|Perl: the Markov chain saw|
Re^2: Finding repeat sequences.by BrowserUk (Pope)
|on Jun 18, 2013 at 19:59 UTC||Need Help??|
They are kind of hard to come up with, but okay.
Given the rep 'aaaabaaaaba' and a string containing one whole and one partial rep 'aaaabaaaabaaaaabaaaab'
Which isn't correct because:
You can fix that by removing the redundant .* per LanX's version: m[(.+)\1] but then you get:
Which isn't right:
I realise that this is a 'cheat' as there in no complete repetition to find, but it is one possible scenario.
Given the string will always consist of 1 or more repetitions of the substring, whatever partial substring (if any) is at the end of the string should match the same number of characters at the start of the string. That's the bit I'm having trouble wrapping my head around.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.