APX

Superstrings with multiplicities

A superstring of a set of words $P = s_1, ..., s_p $ is a string that contains each word of P as substring. Given P, the well known Shortest Linear Superstring problem (SLS), asks for a shortest superstring of P. In a variant of SLS, called …