I think that I understand your requirements.
Given a set of strings.
- Split each string into a list of substrings of at least three character each
- From the set of all possible decompositions, select the one with the lowest score
Scoring a decomposition
- Form the set of all the substrings (Keep only one of each duplicated substrings)
- Sum the lengths of all the substrings in that set.
- The score is that sum plus twice the number of substrings in the set.
I suspect that execution time of any solution would be exponential in the total number of characters.
Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
Want more info? How to link or
or How to display code and escape characters
are good places to start.