I don't get much feel for your real world problem from this description. Perhaps it would be worth devising a little test harness with test strings ranging from 'toy' to 'realistic', that also encapsulates realistic limits and shows both the optimal result and the range of suboptimal solutions that would be good enough to be useful.
That would also give you a consistent basis from which to evaluate any solutions you or the assembled monks might devise.
Hugo
In reply to Re: String Compression Optimization (repeated concatenated subsequences)
by hv
in thread String Compression Optimization (repeated concatenated subsequences)
by QM
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |