A 2 superstring approximation algorithm

Given a collection of strings ifS = s1, …, sn over an alphabet ∑, a superstring α of S is a string containing each si, as a substring; that is, for each i, 1⩽ i ⩽n, α contains a block of ¦si¦ consecutive characters that match si exactly. The shortest superstring problem is the problem of finding a s... View More