Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re^7: Fast common substring matching

by bioMan (Beadle)
on Nov 30, 2005 at 19:33 UTC ( #513065=note: print w/ replies, xml ) Need Help??


in reply to Re^6: Fast common substring matching
in thread Fast common substring matching

Thanks for the clarification. For some reason I got it in my head that the minimum length of the substring had to be a power of 2. That idea must have come from someone else's algorithm for the longest common string search.

Nontheless, your script has been very useful to me.

Mike


Comment on Re^7: Fast common substring matching

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (9)
As of 2014-11-28 19:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (200 votes), past polls