get the best and fastest answer
|
|
|
|
Clear questions and runnable code get the best and fastest answer |
|
| PerlMonks |
Re: Seeking algorithm for finding common continous sub-patternsby Jaap (Curate) |
| on Dec 03, 2004 at 07:58 UTC ( [id://412063]=note: print w/replies, xml ) | Need Help?? |
|
What did you come up with so far? How slow is the no-brainer way? What performance are you looking for? Edit: Should they occur m times in different "subarrays"?
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||