good chemistry is complicated, and a little bit messy -LW |
|
PerlMonks |
Re: Finding repeat sequences.by LanX (Saint) |
on Jun 21, 2013 at 01:03 UTC ( [id://1040046]=note: print w/replies, xml ) | Need Help?? |
Still struggling to understand the task... is $str = ($pattern x $n ) . substr($pattern,0,$k) with 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. Cheers Rolf ( addicted to the Perl Programming Language)
test
In Section
Seekers of Perl Wisdom
|
|