Are there usefull constraints on the sub-string match such as a minimum interesting length, or a match may only start at every nth character or a constraint on the maximum match length?
Note that it would help for people copying the data from your scratch pad if the data were between <code> </code> tags.
Update: I guess the comment in the OP code means that 200 characters is the minimum usefull match?In reply to Re: Search for identical substrings
by GrandFather
in thread Search for identical substrings
by bioMan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |