The minimum substring cover problem

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

doi:10.1007/978-3-540-77918-6_14

The minimum substring cover problem

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

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 language	English
Title of host publication	Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
Publisher	Springer Verlag
Pages	170-183
Number of pages	14
ISBN (Print)	3540779175, 9783540779179
DOIs	https://doi.org/10.1007/978-3-540-77918-6_14
State	Published - 2008
Externally published	Yes
Event	5th International Workshop on Approximation and Online Algorithms, WAOA 2007 - Eilat, Israel Duration: 11 Oct 2007 → 12 Oct 2007

Publication series

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

Conference

Conference	5th International Workshop on Approximation and Online Algorithms, WAOA 2007
Country/Territory	Israel
City	Eilat
Period	11/10/07 → 12/10/07

Access to Document

10.1007/978-3-540-77918-6_14

Cite this

Hermelin, D., Rawitz, D., Rizzi, R., & Vialette, S. (2008). The minimum substring cover problem. In Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers (pp. 170-183). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4927 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-77918-6_14

@inproceedings{286e8340456c4e488e205ab6c27d0cbb,

title = "The minimum substring cover problem",

abstract = "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.",

author = "Danny Hermelin and Dror Rawitz and Romeo Rizzi and St{\'e}phane Vialette",

year = "2008",

doi = "10.1007/978-3-540-77918-6_14",

language = "אנגלית",

isbn = "3540779175",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "170--183",

booktitle = "Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers",

address = "גרמניה",

note = "5th International Workshop on Approximation and Online Algorithms, WAOA 2007 ; Conference date: 11-10-2007 Through 12-10-2007",

}

Hermelin, D, Rawitz, D, Rizzi, R & Vialette, S 2008, The minimum substring cover problem. in Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4927 LNCS, Springer Verlag, pp. 170-183, 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, Eilat, Israel, 11/10/07. https://doi.org/10.1007/978-3-540-77918-6_14

The minimum substring cover problem. / Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo et al.
Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. Springer Verlag, 2008. p. 170-183 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4927 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The minimum substring cover problem

AU - Hermelin, Danny

AU - Rawitz, Dror

AU - Rizzi, Romeo

AU - Vialette, Stéphane

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49949096519&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77918-6_14

DO - 10.1007/978-3-540-77918-6_14

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:49949096519

SN - 3540779175

SN - 9783540779179

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 170

EP - 183

BT - Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers

PB - Springer Verlag

T2 - 5th International Workshop on Approximation and Online Algorithms, WAOA 2007

Y2 - 11 October 2007 through 12 October 2007

ER -

Hermelin D, Rawitz D, Rizzi R, Vialette S. The minimum substring cover problem. In Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. Springer Verlag. 2008. p. 170-183. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-77918-6_14

The minimum substring cover problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this