in reply to Analysing a (binary) string. (Solved)
Is there a constraint on the minimum interesting substring length?
Can you treat a "short" part of the large string as representative for purposes of discovering the repeating substring?
Is there a minimum or maximum amount of "padding" between repeats?
May there be non-repeating header or tail sections in the large string?
Maybe a little more of the bigger picture may help understand the constraints on the problem?
True laziness is hard work
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Analysing a (binary) string.
by BrowserUk (Patriarch) on Jun 28, 2013 at 07:02 UTC |
In Section
Seekers of Perl Wisdom