![]() |
|
Just another Perl shrine | |
PerlMonks |
Re^7: Fast common substring matchingby bioMan (Beadle) |
on Nov 30, 2005 at 19:33 UTC ( #513065=note: print w/replies, xml ) | Need Help?? |
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
|
|