Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

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

by lima1 (Curate)
on Apr 04, 2007 at 22:12 UTC ( #608380=note: print w/replies, xml ) Need Help??


in reply to Re^3: Challenge: Fast Common Substrings (O(n)?)
in thread Challenge: Fast Common Substrings

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,...).
  • Comment on Re^4: Challenge: Fast Common Substrings (O(n)?)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://608380]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (3)
As of 2016-12-04 11:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (64 votes). Check out past polls.