Improved combinatorial group testing algorithms for real-world problem sizes

SIAM Journal on Computing

Volumn 36, Issue 5, 2006, Pages 1360-1375

  Eppstein, David ^a   Goodrich, Michael T ^a   Hirschberg, Daniel S ^a  

^a Irvine   (United States)

Author keywords

Bloom filters; Chinese remaindering; Combinatorial group testing

Indexed keywords

COMBINATORIAL GROUP TESTING; REAL-WORLD PROBLEM;

ALGORITHMS; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING; REAL TIME SYSTEMS; SET THEORY;

COMPUTATION THEORY;

EID: 35449004128     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050631847     Document Type: Article

References (15)

1. E. BACH AND J. SHALLIT, Algorithmic Number Theory, Vol. 1: Efficient Algorithms, MIT Press, Cambridge, MA, 1996.
2. B. H. BLOOM, Space/time trade-offs in hash coding with allowable errors, Comm. ACM, 13 (1970), pp. 422-426.
3. C. J. COLBOURN, J. H. DINITZ, AND D. R. STINSON, Applications of combinatorial designs to communications, cryptography, and networking, in Surveys in Combinatorics, 1993, London Math. Soc. Lecture Note Ser. 187, J. D. Lamb and D. A. Preece, eds., Cambridge University Press, Cambridge, UK, 1999, pp. 37-100..
4. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
5. A. DE BONIS, L. GASIENIEC, AND U. VACCARO, Generalized framework for selectors with applications in optimal group testing, in Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03), Springer, Berlin, 2003, pp. 81-96.
6. D.-Z. DU AND F. K. HWANG, Combinatorial Group Testing and Its Applications, 2nd ed., World Scientific, River Edge, NJ, 2000.
7. k), Rapport 1998-06, Laboratoire d'Arithmétique, de Calcul formel et d'Optimisation, Limoges, Cedex, France, http://www.unilim.fr/laco/rapports/1998/R1998_06.pdf (1998).
8. P. DUSART, The kth prime is greater than k(ln k + ln ln k - 1) for k ≥ 2, Math. Comp., 68 (1999), pp. 411-415.
9. D. EPPSTEIN, M. T. GOODRICH, AND D. S. HIRSCHBERG, Improved combinatorial group testing for real-world problem sizes, in Algorithms and Data Structures, 9th International Workshop, WADS 2005, Lecture Notes Comput. Sci. 3608, Springer, Berlin, 2005, pp. 86-98.
10. M. FARACH, S. KANNAN, E. KNILL, AND S. MUTHUKRISHNAN, Group testing problems with sequences in experimental molecular biology, in SEQUENCES, IEEE Press, Washington, DC, 1997, pp. 357-367.
11. F. K. HWANG AND V. T. SOS, Non-adaptive hypergeometric group testing, Studia Sci. Math. Hungar., 22 (1987), pp. 257-263.
12. W. H. KAUTZ AND R. C. SINGLETON, Nonrandom binary superimposed codes, IEEE Trans. Information Theory, 10 (1964), pp. 363-377.
13. A. J. MACULA AND G. R. REUTER, Simplified searching for two defects, J. Statist. Plann. Inference, 66 (1998), pp. 77-82.
14. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, New York, 1995.
15. 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.