Abstract
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguished” by a family of “tests”, and we want to find the smallest sufficient collection of tests. In the simplest version, a test is a subset of the universe and two objects are distinguished by our collection if one test contains exactly one of them. Variations allow tests to be multi-valued functions or unions of “basic” tests, and different notions of the term distinguished. An important version of this problem that has applications in DNA sequence analysis has the universe consisting of strings over a small alphabet and tests that are detecting presence (or absence) of a substring. For most versions of the problem, including the latter, we establish matching lower and upper bounds on approximation ratio. When tests can be formed as unions of basic tests, we show that the problem is as hard as the graph coloring problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu-Mostafa, Y.S. (ed.): Complexity in Information Theory. Springer, Heidelberg (1986)
De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Mathematical Programming-B 98(1-3), 477–491 (2003)
Borneman, J., Chrobak, M., Vedova, G.D., Figueroa, A., Jiang, T.: Probe Selection Algorithms with Applications in the Analysis of Microbial Communities. Bioinformatics 17(suppl. 1) ,S39-S48 (2001)
Feige, U.: A threshold for approximating set cover. JACM 45, 634–652 (1998)
Feige, U., Kilian, J.: Zero knowledge and the chromatic number. Journal of Computer and System Sciences 57(2), 187–199 (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York (1979)
Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)
Halldórsson, B.V., Halldórsson, M.M., Ravi, R.: On the approximability of the minimum test collection problem. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 158–169. Springer, Heidelberg (2001)
Johnson, D.S.: Approximation Algorithms for Combinatorial Problems, Journal of Computer and Systems Sciences 9, 256–278 (1974)
Karp, R.M., Stoughton, R., Yeung, K.Y.: Algorithms for Choosing Differential Gene Expression Experiments. In: Proc. Third Annual International Conference on Computational Molecular Biology, pp. 208–217 (1999)
Lovasz, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics 13, 383–390 (1975)
Moret, B.M.E., Shapiro, H.D.: On minimizing a set of tests. SIAM Journal on Scientific and Statistical Computing 6, 983–1003 (1985)
Rash, S., Gusfield, D.: String Barcoding: Uncovering Optimal Virus Signatures. In: Proc. Sixth Annual International Conference on Computational Molecular Biology, pp. 254–261 (2002)
Shannon, C.E.: Mathematical Theory of Communication. Bell Systems Technical Journal 27, 379–423, 623-658 (1948)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, P., DasGupta, B., Kao, MY. (2004). Tight Approximability Results for Test Set Problems in Bioinformatics. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive