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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Johnson, D.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256–278 (1974)
Lovász, L.: On the ratio of optimal integeral and fractional solutions. Discrete Mathematics 13, 383–390 (1974)
Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)
Hochbaum, D.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555–556 (1982)
Bar-Yehuda, R., Even, S.: A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)
Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
Bodlaender, H., Downey, R., Fellows, M., Hallett, M., Wareham, H.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1), 49–57 (1995)
Dorit, R., Gilbert, W.: The limited universe of exons. Current Opinions in Structural Biology 1, 973–977 (1991)
Patthy, L.: Exons - original building blocks of proteins? BioEssays 13(4), 187–192 (1991)
Choffrut, C., Karhumäki, J.: Combinatorics of Words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Springer, Heidelberg (1997)
Néraud, J.: Elementariness of a finite set of words is co-NP-complete. Theoretical Informatics and Applications 24(5), 459–470 (1990)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, London (1980)
Ehrenfeucht, A., Rozenberg, G.: Elementary homomorphisms and a solution of the D0L sequence equivalence problem. Theoretical Computer Science 7, 169–183 (1978)
Hassin, R., Segev, D.: The set cover with pairs problem. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 164–176. Springer, Heidelberg (2005)
Huang, Y.T., Chao, K.M., Chen, T.: An approximation algorithm for haplotype inference by maximum parsimony. In: Proceedings of the 20’th ACM Symposium on Applied Computing (SAC), pp. 146–150 (2005)
Hajiaghayi, M., Jain, K., Lau, L., Mandoiu, I.: Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 758–766. Springer, Heidelberg (2006)
Bar-Yehuda, R.: One for the price of two: A unified approach for approximating covering problems. Algorithmica 27(2), 131–144 (2000)
Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and Systems Sciences 43, 425–440 (1991)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th ACM Symposium on the Theory Of Computing (STOC), pp. 475–484 (1997)
Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM Journal on Computing 34(5), 1129–1146 (2005)
Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288–298. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hermelin, D., Rawitz, D., Rizzi, R., Vialette, S. (2008). The Minimum Substring Cover Problem. In: Kaklamanis, C., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2007. Lecture Notes in Computer Science, vol 4927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77918-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77918-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77917-9
Online ISBN: 978-3-540-77918-6
eBook Packages: Computer ScienceComputer Science (R0)