Improved combinatorial group testing for real-world problem sizes

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 86-98

  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

INFORMATION THEORY; SET THEORY; TESTING;

NON-ADAPTIVE GROUP TESTING ALGORITHMS; TWO-STAGE COMBINATORIAL GROUP TESTING;

ALGORITHMS;

EID: 26844550492     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_9     Document Type: Conference Paper

References (13)

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. Commun. ACM, 13:422-426, 1970.
3. Colbourn, Dinitz, and Stinson. Applications of combinatorial designs to communications, cryptography, and networking. In Surveys in Combinatorics, 1993, Walker (Ed.), London Mathematical Society Lecture Note Series 187. Cambridge University Press, 1999.
4. A. DeBonis, L. Gasieniec, and U. Vaccaro. Generalized framework for selectors with applications in optimal group testing. In Proceedings of 30th International Colloquium on Automata, Languages and Programming (ICALP'03), pages 81-96. Springer, 2003.
5. D.-Z. Du and F. K. Hwang. Combinatorial Group Testing and Its Applications, 2nd ed. World Scientific, 2000.
6. k). Report, Laboratoire d'Arithmétique, de Calcul formel et d'Optimisation, 1998. Rapport no. 1998-06, http://www.unilim.fr/laco/rapports/1998/R1998_06.pdf.
7. P. Dusart. The kth prime is greater than k(ln k + ln ln k - 1) for k ≥ 2. Math. Comp., 68(225):411-415, 1999.
8. M. Farach, S. Kannan, E. Knill, and S. Muthukrishnan. Group testing problems with sequences in experimental molecular biology. In SEQUENCES, page 357. IEEE Press, 1997.
9. F. K. Hwang and V. T. Sós. Non-adaptive hypergeometric group testing. Studia Scient. Math. Hungarica, 22:257-263, 1987.
10. W. H. Kautz and R. C. Singleton. Nonrandom binary superimposed codes. IEEE Trans. Inf. Th., 10:363-377, 1964.
11. A. J. Macula and G. R. Reuter. Simplified searching for two defects. J. Stat. Plan. Inf., 66:77-82, 1998.
12. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
13. M. Ruszinkó. On the upper bound of the size of the r-cover-free families. J. Combin. Th. Ser. A, 66:302-310, 1994.