... for bioMan's problem a minimum match quanta of 128 is probably optimum and I'd guess that that is long enough to be unlikely to be a problem.
Seems to be. Scanning for repeating sequences of 2, 3 & 4 characters, none was longer then 50 chars, so a minimum quanta of 64 would also probably be possible.
inclined to ignore it unless someone can convince me that this is really useful
I understand that totally. I ended up resorting to Inline C to get speed because every attempt to improved the performance of my perl versions ended up missing things.
Shame though. Your technique is so very fast for a pure perl solution it would be a real coup if it could be generalised.
In reply to Re^5: Fast common substring matching
by BrowserUk
in thread Fast common substring matching
by GrandFather
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |