The minimum substring cover problem

Authors:
Danny Hermelin;Dror Rawitz;Romeo Rizzi;Stéphane Vialette
Affiliations:
Department of Computer Science, University of Haifa, Haifa, Israel;School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel;Dipartimento di Matematica ed Informatica, Università di Udine, Udine, Italy;Laboratoire de Recherche en Informatique, Université Paris-Sud, Orsay, France
Venue:
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Year:
2007

Citing 8
Cited 1

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Combinatorics of words

Handbook of formal languages, vol. 1
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Hardness of Approximating Problems on Cubic Graphs

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
An approximation algorithm for haplotype inference by maximum parsimony

Proceedings of the 2005 ACM symposium on Applied computing
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

SIAM Journal on Computing
The set cover with pairs problem

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II

On Finding Small 2-Generating Sets

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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