A series of sequential applications of the Split algorithm can have single applications with negative compression, while the whole series shows positive compressions.
Therefore discarding steps with negative compression by default can lead to getting stuck in a local optima.
Exploring all possible application orders is obviously not feasible for reasons of performance. Adapting local search algorithms to this problem could increase the achieved compression ratio.