Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

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.


Comment on Re^7: Fast common substring matching

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (3)
As of 2015-11-26 13:17 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (699 votes), past polls