On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals

Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski +2

We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor ever…