![]() |
|
good chemistry is complicated, and a little bit messy -LW |
|
PerlMonks |
Re^6: Fast common substring matchingby bioMan (Beadle) |
on Nov 29, 2005 at 22:37 UTC ( #512790=note: print w/replies, xml ) | Need Help?? |
I had thought it was just some sort of cryptic progress meter. :-) LOL - I know what you mean. I'm still going over your original code to see how you did what you did -- trying to learn some perl :-) I'll give the new code a try. I also see that the minimum length in your code doesn't have to be a power of 2. This should allow me to analyze a limit boundary that appears to be present in my data. Grandfather's code allowed me to come up with what I feel is a pretty good estimate for the value of the limit, but this should allow a closer examination of the limit.
Mike
In Section
Cool Uses for Perl
|
|