The minimum substring cover problem

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


In this paper we consider the problem of covering a set of strings S with a set C of substrings in S, where C is said to cover S if every string in S can be written as a concatenation of the substrings in C. We discuss applications for the problem that arise in the context of computational biology and formal language theory. We then proceed to show that this problem is at least as hard as the PBMinimum Set Cover problem. In the main part of the paper, we focus on devising approximation algorithms for the problem using two generic paradigms - the local-ratio technique and linear programming rounding.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540779175, 9783540779179
StatePublished - 2008
Externally publishedYes
Event5th International Workshop on Approximation and Online Algorithms, WAOA 2007 - Eilat, Israel
Duration: 11 Oct 200712 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4927 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Approximation and Online Algorithms, WAOA 2007


Dive into the research topics of 'The minimum substring cover problem'. Together they form a unique fingerprint.

Cite this