Algorithms for Three Versions of the Shortest Common Superstring Problem

Maxime Crochemore (1, 2) , Marek Cygan (3) , Costas S. Iliopoulos (1) , Marcin Kubica (4) , Jakub Radoszewski (4) , Wojciech Rytter (4) , Tomasz Walen (4)

1 Informatics
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
4 Institute of Informatics [Warsaw]

The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in which each s in S occurs at least once. In our paper we consider two versions with multiple occurrences, in which the input includes additional numbers (multiplicities), given in binary. Our output is the word SCS(S) given implicitly in a compact form, since its real size could be exponential. We also consider a case when all input words are of length two, where our main algorithmic tool is a compact representation of Eulerian cycles in multigraphs. Due to exponential multiplicities of edges such cycles can be exponential and the compact representation is needed. Other tools used in our paper are a polynomial case of integer linear programming and a min-plus product of matrices.

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, et al.. Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM, 2010, New-York, United States. pp.299-309. ⟨hal-00742040⟩