Suppose someone gives you two strings: X and Y. Your goal is to design a minimum-cost collection of smaller strings coll (X|Y)
that match and cover every character of string X With order independence without matching any substring of string Y.
Let us first break down that last sentence: