License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2018.18
URN: urn:nbn:de:0030-drops-89530
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8953/
Go to the corresponding LIPIcs Volume Portal


Cazaux, Bastien ; Juhel, Samuel ; Rivals, Eric

Practical lower and upper bounds for the Shortest Linear Superstring

pdf-format:
LIPIcs-SEA-2018-18.pdf (0.6 MB)


Abstract

Given a set P of words, the Shortest Linear Superstring (SLS) problem is an optimisation 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 an approximate 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 remainso efficient even on large instances and can serve to explore in practice the approximability of SLS.

BibTeX - Entry

@InProceedings{cazaux_et_al:LIPIcs:2018:8953,
  author =	{Bastien Cazaux and Samuel Juhel and Eric Rivals},
  title =	{{Practical lower and upper bounds for the Shortest Linear Superstring}},
  booktitle =	{17th International Symposium on Experimental Algorithms  (SEA 2018)},
  pages =	{18:1--18:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{Gianlorenzo D'Angelo},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8953},
  URN =		{urn:nbn:de:0030-drops-89530},
  doi =		{10.4230/LIPIcs.SEA.2018.18},
  annote =	{Keywords: greedy, approximation, overlap, Concat-Cycles, cyclic cover, linear time, text compression}
}

Keywords: greedy, approximation, overlap, Concat-Cycles, cyclic cover, linear time, text compression
Collection: 17th International Symposium on Experimental Algorithms (SEA 2018)
Issue Date: 2018
Date of publication: 19.06.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI