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
|
---|
In Section
Cool Uses for Perl