@inproceedings{3310722adac845e1bb7f776ee52e7842,

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 = "Dan Hermelin and Dror Rawitz and Romeo Rizzi and St{\'e}phane Vialette",

year = "2007",

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

language = "אנגלית",

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

publisher = "Springer",

pages = "170--183",

editor = "Christos Kaklamanis and Skutella, {Martin }",

booktitle = "Approximation and Online Algorithms",

address = "גרמניה",

note = "null ; Conference date: 11-10-2007 Through 12-10-2007",

}