TY - JOUR

T1 - Tight approximability results for test set problems in bioinformatics

AU - Berman, Piotr

AU - DasGupta, Bhaskar

AU - Kao, Ming-Yang

PY - 2004/12/1

Y1 - 2004/12/1

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

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

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

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

M3 - Article

AN - SCOPUS:25144496859

SN - 0302-9743

VL - 3111

SP - 39

EP - 50

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -