|laziness, impatience, and hubris|
Re: Finding repeat sequences.by LanX (Chancellor)
|on Jun 21, 2013 at 01:03 UTC||Need Help??|
Still struggling to understand the task...
$str = ($pattern x $n ) . substr($pattern,0,$k)
0 <= $k < ($l = length($pattern))
and the task is to find maximum $pattern for a given $str to fit these constraints?
If yes, some simple mathematics should already considerably minimize the set of possible combinations you need to investigate with regexes.
( addicted to the Perl Programming Language)