The Minimum Substring Cover problem

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

doi:10.1016/j.ic.2008.06.002

The Minimum Substring Cover problem

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

Research output: Contribution to journal › Article › peer-review

13 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 several hardness of approximation results for the problem, and in the main part of the paper, we focus on devising approximation algorithms using two generic paradigms-the local-ratio technique and linear programming rounding.

Original language	English
Pages (from-to)	1303-1312
Number of pages	10
Journal	Information and Computation
Volume	206
Issue number	11
DOIs	https://doi.org/10.1016/j.ic.2008.06.002
State	Published - Nov 2008
Externally published	Yes

Bibliographical note

Funding Information:
E-mail addresses: [email protected] (D. Hermelin), [email protected] (D. Rawitz), [email protected] (R.Rizzi), [email protected] (S. Vialette). 1 Partially supported by the Caesarea Rothschild Institute (CRI). 2 Supported by the Italian-French PAI Galileo Project 08484VH.

Funding

E-mail addresses: [email protected] (D. Hermelin), [email protected] (D. Rawitz), [email protected] (R.Rizzi), [email protected] (S. Vialette). 1 Partially supported by the Caesarea Rothschild Institute (CRI). 2 Supported by the Italian-French PAI Galileo Project 08484VH.

Funders	Funder number
Caesarea Rothschild Institute	08484VH

Keywords

Approximation algorithms
Dictionary Generation
Local-ratio
Randomized rounding
Substring Cover

Access to Document

10.1016/j.ic.2008.06.002

Cite this

@article{03a8231c63e44616b379100061790da4,

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 several hardness of approximation results for the problem, and in the main part of the paper, we focus on devising approximation algorithms using two generic paradigms-the local-ratio technique and linear programming rounding.",

keywords = "Approximation algorithms, Dictionary Generation, Local-ratio, Randomized rounding, Substring Cover",

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

note = "Funding Information: E-mail addresses: [email protected] (D. Hermelin), [email protected] (D. Rawitz), [email protected] (R.Rizzi), [email protected] (S. Vialette). 1 Partially supported by the Caesarea Rothschild Institute (CRI). 2 Supported by the Italian-French PAI Galileo Project 08484VH.",

year = "2008",

month = nov,

doi = "10.1016/j.ic.2008.06.002",

language = "אנגלית",

volume = "206",

pages = "1303--1312",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

number = "11",

}

TY - JOUR

T1 - The Minimum Substring Cover problem

AU - Hermelin, Danny

AU - Rawitz, Dror

AU - Rizzi, Romeo

AU - Vialette, Stéphane

N1 - Funding Information: E-mail addresses: [email protected] (D. Hermelin), [email protected] (D. Rawitz), [email protected] (R.Rizzi), [email protected] (S. Vialette). 1 Partially supported by the Caesarea Rothschild Institute (CRI). 2 Supported by the Italian-French PAI Galileo Project 08484VH.

PY - 2008/11

Y1 - 2008/11

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 several hardness of approximation results for the problem, and in the main part of the paper, we focus on devising approximation algorithms 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 several hardness of approximation results for the problem, and in the main part of the paper, we focus on devising approximation algorithms using two generic paradigms-the local-ratio technique and linear programming rounding.

KW - Approximation algorithms

KW - Dictionary Generation

KW - Local-ratio

KW - Randomized rounding

KW - Substring Cover

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

U2 - 10.1016/j.ic.2008.06.002

DO - 10.1016/j.ic.2008.06.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:53449094339

SN - 0890-5401

VL - 206

SP - 1303

EP - 1312

JO - Information and Computation

JF - Information and Computation

IS - 11

ER -

The Minimum Substring Cover problem

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this