Basic Question: Is there any simple way in Perl to find the most common substring?
Complex Question: I'd really like to take a long number (say 100,000 digits long) and find the least and the most common strings of a given length (say 5). The three approaches that come to mind are:
Somehow the last approach seems most "elegant" to me, but I'm fuzzy on it. But general comments on how to go about this are totally helpful. I had troubles figuring out what terms to google to find out about algorithms that might do this sort of "parsing of all substrings".
In reply to Most common substring by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |