Competitive group testing and learning hidden vertex covers with minimum adaptivity

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

Volumn 5699 LNCS, Issue , 2009, Pages 84-95

  Damaschke, Peter ^a   Sheikh Muhammad, Azam ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVITY; BIOLOGICAL NETWORKS; FPT ALGORITHMS; GROUP TESTING; LOWER BOUNDS; OPTIMAL CONSTANT; OPTIMAL NUMBER; RANDOMIZED STRATEGY; SMALL SIZE; VERTEX COVER;

COMPUTATION THEORY; CONTROL THEORY; ELECTRIC NETWORK ANALYSIS; OPTIMIZATION;

LAKES;

EID: 70350666512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03409-1_9     Document Type: Conference Paper

References (16)

1. Alon, N., Asodi, V.: Learning a Hidden Subgraph. SIAM J. Discr. Math. 18, 697-712 (2005)
2. Angluin, D., Chen, J.: Learning a Hidden Graph Using O(log n) Queries per Edge. J. Computer and System Sci. 74, 546-556 (2008)
3. Bar-Noy, A., Hwang, F.K., Kessler, H., Kutten, S.: A New Competitive Algorithm for Group Testing. Discr. Appl. Math. 52, 29-38 (1994)
4. Bouvel, M., Grebinski, V., Kucherov, G.: Combinatorial Search on Graphs Motivated by Bioinformatics Applications. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 16-27. Springer, Heidelberg (2005)
5. Chen, H.B., Fu, H.L., Hwang, F.K.: An Upper Bound on the Number of Tests in Pooling Designs for the Error-Tolerant Complex Model. Optim. Letters 2, 425-431 (2008)
6. Chen, J., Kanj, I.A., Xia, G.: Simplicity is Beauty: Improved Upper Bounds for Vertex Cover. Technical report (2008)
7. Cheng, Y., Du, D.Z.: New Constructions of One- and Two-Stage Pooling Designs. J. Comp. Biol. 15, 195-205 (2008)
8. Damaschke, P.: On Parallel Attribute-Efficient Learning. J. Computer and System Sci. 67, 46-62 (2003)
9. Damaschke, P.: Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. Theor. Computer Sci. 351, 337-350 (2006)
10. De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comp. 34, 1253-1270 (2005)
11. Du, D.Z., Park, H.: On Competitive Group Testing. SIAM J. Comp. 23, 1019-1025 (1994)
12. Du, D.Z., Xue, G., Sun, S.Z., Cheng, S.W.: Modifications of Competitive Group Testing. SIAM J. Comp. 23, 82-96 (1994)
13. Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comp. 36, 1360-1375 (2007)
14. Kahng, A.B., Reda, S.: New and Improved BIST Diagnosis Methods from Combinatorial Group Testing Theory. IEEE Trans. CAD of Integr. Circuits and Systems 25, 533-543 (2006)
15. Lappe, M., Holm, L.: Unraveling Protein Interaction Networks with Near-Optimal Efficiency. Nature Biotech. 22, 98-103 (2003)
16. Schlaghoff, J., Triesch, E.: Improved Results for Competitive Group Testing. Comb., Prob. and Comp. 14, 191-202 (2005)