3-Shortest Superstring is 2-approximable by a greedy algorithm - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports (Research Report) Year : 2014

3-Shortest Superstring is 2-approximable by a greedy algorithm


A superstring of a set of words is a string that contains each input word as a sub-string. Given such a set, the Shortest Superstring Problem (SSP) asks for a super-string of minimum length. SSP is an important theoretical problem related to the Asymmetric Travelling Salesman Problem, and also has practical applications in data compression and in bioinformatics. Indeed, it models the question of assembling a genome from a set of sequencing reads. Unfortunately, SSP is known to be NP-hard even on a binary alphabet and also hard to approximate with respect to the superstring length or to the compression achieved by the superstring. Even the variant in which all words share the same length r, called r-SSP, is NP-hard whenever r > 2. Numerous involved approximation algorithms achieve approximation ratio above 2 for the superstring, but remain difficult to implement in practice. In contrast the greedy conjecture asked in 1988 whether a simple greedy agglomeration algorithm achieves ratio of 2 for SSP. Here, we present a novel approach to bound the superstring approximation ratio with the compression ratio, which leads to a first proof of the greedy conjecture for 3-SSP.
Fichier principal
Vignette du fichier
approx-kSCS-RR.pdf (259.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01070596 , version 1 (01-10-2014)


  • HAL Id : lirmm-01070596 , version 1
  • PRODINRA : 314005


Bastien Cazaux, Eric Rivals. 3-Shortest Superstring is 2-approximable by a greedy algorithm. [Research Report] RR-14009, LIRMM. 2014. ⟨lirmm-01070596⟩
810 View
287 Download


Gmail Facebook X LinkedIn More