HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Practical lower and upper bounds for the Shortest Linear Superstring

Bastien Cazaux 1, 2 Samuel Juhel 1, 2 Eric Rivals 1, 2
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Given a set P of words, the Shortest Linear Superstring (SLS) problem is an optimization problem that asks for a superstring of $P$ of minimal length. SLS has applications in data compression, where a superstring is a compact representation of $P$, and in bioinformatics where it models the first step of genome assembly. Unfortunately SLS is hard to solve (NP-hard) and to closely approximate (MAX-SNP-hard). If numerous polynomial time approximation algorithms have been devised, few articles report on their practical performance. We lack knowledge about how closely an approximate superstring can be from an optimal one in practice. Here, we exhibit a linear time algorithm that reports an upper and a lower bound on the length of an optimal superstring. The upper bound is the length of a superstring. This algorithm can be used to evaluate beforehand whether one can get an approximate superstring whose length is close to the optimum for a given instance. Experimental results suggest that its approximation performance is orders of magnitude better than previously reported practical values. Moreover, the proposed algorithm remain efficient even on large instances and can serve to explore in practice the approximability of SLS.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

Contributor : Eric Rivals Connect in order to contact the contributor
Submitted on : Wednesday, November 21, 2018 - 10:48:40 AM
Last modification on : Wednesday, November 3, 2021 - 6:11:19 AM
Long-term archiving on: : Friday, February 22, 2019 - 1:02:58 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Bastien Cazaux, Samuel Juhel, Eric Rivals. Practical lower and upper bounds for the Shortest Linear Superstring. SEA: Symposium on Experimental Algorithms, Jun 2018, L'Aquilla, Italy. pp.18:1--18:14, ⟨10.4230/LIPIcs.SEA.2018.18⟩. ⟨lirmm-01929399⟩



Record views


Files downloads