Optimal two-stage algorithms for group testing problems

SIAM Journal on Computing

Volumn 34, Issue 5, 2005, Pages 1253-1270

  De Bonis, Annalisa ^a   Ga̧sieniec, Leszek ^b   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Cover free families; Group testing

Indexed keywords

BIOLOGICAL SCREENING; COVER-FREE FAMILIES; GROUP TESTING; TWO-STAGE ALGORITHMS;

COMBINATORIAL MATHEMATICS; DATA COMPRESSION; MOLECULAR BIOLOGY; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY;

ALGORITHMS;

EID: 27144547067     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703428002     Document Type: Article

References (56)

1. R. AHLSWEDE AND I. WEGENER, Search Problems, John Wiley & Sons, New York, 1987.
2. M. AIGNER, Combinatorial Search, Wiley-Teubner, New York, Stuttgart, 1988.
3. N. ALON AND V. ASODI, Learning a hidden subgraph, SIAM J. Discrete Math., 18 (2005), pp. 697-712.
4. D. ANGLUIN, Queries and concept learning, Mach. Learn., 2 (1987), pp. 319-342.
5. E. BARILLOT, B. LACROIX, AND D. COHEN, Theoretical analysis of library screening using an n-dimensional pooling strategy, Nucleic Acids Res., 19 (1991), pp. 6241-6247.
6. D. J. BALDING, W. J. BRUNO, E. KNILL, AND D. C. TORNEY, A comparative survey of non-adaptive pooling design, in Genetic Mapping and DNA Sequencing, IMA Vol. Math. Appl. 81, T. P. Speed and M. S. Waterman, eds., Springer-Verlag, Berlin, 1996, pp. 133-154.
7. T. BERGER AND V. I. LEVENSHTEIN, Asymptotic efficiency of two-stage disjunctive testing, IEEE Trans. Inform. Theory, 48 (2002), pp. 1741-1749.
8. T. BERGER AND V. I. LEVENSHTEIN, Application of cover-free codes and combinatorial design to two-stage testing, Discrete Appl. Math., 128 (2003), pp. 11-26.
9. T. BERGER, J. W. MANDELL, AND P. SUBRAHMANYA, Maximally efficient two-stage screening, Biometrics, 56 (2000), pp. 833-840.
10. W. J. BRUNO, D. J. BALDING, E. KNILL, D. BRUCE, C. WHITTAKER, N. DOGGET, R. STALLING, AND D. C. TORNEY, Design of efficient pooling experiments, Genomics, 26 (1995), pp. 21-30.
11. P. BUSSBACH, Constructive Methods to Solve Problems of s-surjectivity, Conflict Resolution, and Coding in Defective Memories, Tech. report 84D005, Ecole Nationale des Telecomm., ENST Paris, 1984.
12. S. CHAUDHURI AND J. RADHAKRISHNAN, Deterministic restrictions in circuit complexity, in Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC '96), ACM, New York, 1996, pp. 30-36.
13. M. CHROBAK, L. GA̧SIENIEC, AND W. RYTTER, Fast broadcasting and gossiping in radio networks, J. Algorithms, 43 (2002), pp. 177-189.
14. F. CICALESE, D. MUNDICI, AND U. VACCARO, Least adaptive optimal search with unreliable tests, Theoret. Comput. Sci., 270 (2002), pp. 877-893.
15. A. E. F. CLEMENTI, A. MONTI, AND R. SILVESTRI, Selective families, superimposed codes, and broadcasting on unknown radio networks, in Proceedings of the Twelth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), SIAM, Philadelphia, ACM, New York, 2001, pp. 709-718.
16. G. CORMODE AND S. MUTHUKRISHNAN, What's hot and what's not: Tracking most frequent items dynamically, in Proceedings of the 22nd ACM Symposium on Principles of Database Systems, ACM, New York, 2003, pp. 296-306.
17. P. DAMASCHKE, Adaptive versus nonadaptive attribute-efficient learning, in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC '98), ACM, New York, 1998, pp. 590-596.
18. P. DAMASCHKE, Parallel attribute-efficient learning of monotone Boolean functions, in Algorithm Theory - SWAT 2000, Lecture Notes in Comput. Sci. 1851, M. M. Halldórsson, ed., Springer-Verlag, Berlin, 2000, pp. 504-512.
19. P. DAMASCHKE, Computational aspects of parallel attribute-efficient learning, in Proceedings of the 9th International Conference on Algorithmic Learning Theory, Lecture Notes in Comput. Sci. 1501, M. Richter et al., eds., Springer-Verlag, Berlin, 1998, pp. 103-111.
20. P. DAMASCHKE, Randomized group testing for mutually obscuring defectives, Inform. Process. Lett., 67 (1998), pp. 131-135.
21. A. DE BONIS AND U. VACCARO, Improved algorithms for group testing with inhibitors, Inform. Process. Lett., 66 (1998), pp. 57-64.
22. A. DE BONIS AND U. VACCARO, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels, Theoret. Comput. Sci., 306 (2003), pp. 223-243.
23. R. DORFMAN, The detection of defective members of large populations, Ann. Math. Statist., 14 (1943), pp. 436-440.
24. D. Z. DU AND F. K. HWANG, Combinatorial Group Testing and Its Applications, World Scientific, River Edge, NJ, 2000.
25. A. G. DYACHKOV AND V. V. RYKOV, A survey of superimposed code theory, Problems Control Inform. Theory, 12 (1983), pp. 229-242.
26. A. G. DYACHKOV, P. VILENKIN, A. MACULA, AND D. TORNEY, Families of finite sets in which no intersection of ℓ sets is covered by the union of s others, J. Combin. Theory Ser. A, 99 (2002), pp. 195-218.
27. A. G. DYACHKOV, Private communication, 2003.
28. P. ERDÖS, P. FRANKL, AND Z. FÜREDI, Families of finite sets in which no set is covered by the union of r others, Israel J. Math., 51 (1985), pp. 75-89.
29. M. FARACH, S. KANNAN, E. H. KNILL, AND S. MUTHUKRISHNAN, Group testing problems with sequences in experimental molecular biology, in Proceedings of Compression and Complexity of Sequences, B. Carpentieri, A. De Santis, U. Vaccaro, and J. Storer, eds., IEEE, Piscataway, NJ, 1997, pp. 357-367.
30. Z. FÜREDI, On r-cover free families, J. Combin. Theory Ser. A, 73 (1996), pp. 172-173.
31. E. H. HONG AND R. E. LADNER, Group testing for image compression, IEEE Trans. Image Process., 11 (2002), pp. 901-911.
32. H. Q. NGO AND D.-Z. DU, A survey on combinatorial group testing algorithms with applications to DMA library screening, in Discrete Mathematical Problems with Medical Applications, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 55, AMS, Providence, RI, 2000, pp. 171-182.
33. F. K. HWANG AND Y. C. LIU, Error-tolerant pooling designs with inhibitors, J. Comput. Biol., 10 (2003), pp. 231-236.
34. P. INDYK, Deterministic superimposed coding with application to pattern matching, in Proceedings of the Thirty-ninth IEEE Annual Symposium on Foundations of Computer Science (FOCS '97), IEEE, Piscataway, NJ, 1997, pp. 127-136.
35. P. INDYK, Explicit constructions of selectors and related combinatorial structures, with applications, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), SIAM, Philadelphia, ACM, New York, 2002, pp. 697-704.
36. W. H. KAUTZ AND R. R. SINGLETON, Nonrandom binary superimposed codes, IEEE Trans. Inform. Theory, 10 (1964), pp. 363-377.
37. E. KNILL, Lower bounds for identifying subset members with subset queries, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '95), SIAM, Philadelphia, ACM, New York, 1995, pp. 369-377.
38. J. KOMLÓS AND A. G. GREENBERG, An asymptotically fast non-adaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans. Inform. Theory, 31 (1985), pp. 302-306.
39. R. KUMAR, S. RAJAGOPALAN, AND A. SAHAI, Coding constructions for blacklisting problems without computational assumptions, in Proceedings of the 19th Annual International Cryptology Conference (CRYPTO '99), Lecture Notes in Comput. Sci. 1666, Springer-Verlag, Berlin, 1999, pp. 609-623.
40. C. H. LI, A sequential method for screening experimental variables, J. Amer. Statist. Assoc., 57 (1962), pp. 455-477.
41. N. LINIAL, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), pp. 193-201.
42. L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
43. A. J. MACULA, Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening, J. Comb. Optim., 2 (1999), pp. 385-397.
44. A. J. MACULA, P. VILENKIN, AND D. TORNEY, Two-stage group testing for complexes in the presence of errors, in Discrete Mathematical Problems with Medical Applications, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 55, AMS, Providence, RI, 2000, pp. 145-157.
45. D. MARGARITIS AND S. SKIENA, Reconstructing strings from substrings in rounds, in Proceedings of the Thirty-seventh IEEE Annual Symposium on Foundations of Computer Science (FOCS '95), IEEE, Piscataway, NJ, 1995, pp. 613-620.
46. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
47. A. PELC, Weakly adaptive comparison searching, Theoret. Comput. Sci., 66 (1989), pp. 105-111.
48. A. PELC, Searching games with errors - fifty years of coping with liars, Theoret. Comput. Sci., 243 (2002), pp. 71-109.
49. P. A. PEVZNER AND R. J. LIPSHUTZ, Towards DNA sequencing chips, in Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 841, Springer-Verlag, Berlin, 1994, pp. 143-158.
50. R. L. RIVEST, A. R. MEYER, D. J. KLEITMAN, K. WINKLMANN, AND J. SPENCER, Coping with errors in binary search procedures, J. Comput. System Sci., 20 (1980), pp. 396-404.
51. M. RUSZINKÓ, On the upper bound of the size of the r-cover-free families, J. Combin. Theory Ser. A, 66 (1994), pp. 302-310.
52. M. SOBEL AND P. A. GROLL, Group testing to eliminate efficiently all defectives in a binomial sample, Bell System Tech. J., 38 (1959), pp. 1179-1252.
53. J. SPENCER, Ulam's searching game with a fixed number of lies, Theoret. Comput. Sci., 95 (1992), pp. 307-321.
54. D. R. STINSON, T. VAN TRUNG, AND R. WEI, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Statist. Plann. Inference, 86 (2000), pp. 595-617.
55. J. WOLF, Born again group testing: Multiaccess communications, IEEE Trans. Inform. Theory, 31 (1985), pp. 185-191.
56. M. XIE, K. TATSUOKA, J. SACKS, AND S. S. YOUNG, Group testing with blockers and synergism, J. Amer. Statist. Assoc., 96 (2001), pp. 92-102.