Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Fast String Searching With Suffix Trees
(
marknelson.us
)
3 points
by
Xichekolas
on Jan 30, 2009
|
hide
|
past
|
favorite
|
1 comment
Xichekolas
on Jan 30, 2009
[–]
Summary: Building a Suffix Tree (in O(n) time and space) allows you to search for substrings in O(m) time (m being size of substring).
Link is to article describing algorithm and giving sample code in C++.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Link is to article describing algorithm and giving sample code in C++.