Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^3: Challenge: Fast Common Substrings (O(n)?)

by tye (Cardinal)
on Apr 04, 2007 at 21:53 UTC ( #608378=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Challenge: Fast Common Substrings
in thread Challenge: Fast Common Substrings

The page you link to mentions being able to build them in O(n) but then only really describes how to go from a suffix tree for string $x to one for string $x.$c (1==length$c) in O(length $x). Using that algorithm would require O(N*N) to build the suffix tree for a string of length N.

So I'm not sure I believe the O(N) claim for building the whole suffix tree based on that page.

- tye        


Comment on Re^3: Challenge: Fast Common Substrings (O(n)?)
Re^4: Challenge: Fast Common Substrings (O(n)?)
by lima1 (Curate) on Apr 04, 2007 at 22:12 UTC
    The naive algorithm requires O(N*N). The Ukkonen algorithm needs only O(N). If you want to understand it - it is not trivial - I recommend Gusfields book (Algorithms on Strings,...).

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://608378]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (4)
As of 2014-08-30 15:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (293 votes), past polls