A survey on nonadaptive group testing algorithms through the angle of decoding

Journal of Combinatorial Optimization

Volumn 15, Issue 1, 2008, Pages 49-59

  Chen, Hong Bin ^a   Hwang, Frank K ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Group testing; Nonadaptive algorithms; Pooling designs

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; PROBLEM SOLVING;

GROUP TESTING; NONADAPTIVE ALGORITHMS; POOLING DESIGNS;

STATISTICAL TESTS;

EID: 37249010117     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9083-3     Document Type: Article

References (21)

1. Alon N, Beigel R, Kasif S, Rudich S, Sudakov B (2004) Learning a hidden matching. SIAM J Comput 33:487-501
2. Balding DJ, Bruno WJ, Knill E, Torney DC (1996) A comparative survey of nonadaptive pooling designs. In: Genetic mapping and DNA sequencing. IMA volumes in mathematics and its applications. Springer, Berlin, pp 133-154
3. Chang FH, Chang HL, Hwang FK (2007) Pooling designs for clone library screening in the inhibitor complex model, to appear
4. Chen HB, Du DZ, Hwang FK (2007) An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. J Comb Opt, to appear
5. Chen HB, Fu HL, Hwang FK (2007) An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Opt Lett, to appear
6. De Bonis A, Vaccaro U (1998) Improved algorithms for group testing with inhibitors. Inform Process Lett 67:57-64
7. De Bonis A, Vaccaro U (2003) Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theor Comput Sci 306:223- 243
8. De Bonis A, Gasieniec L, Vaccaro U (2005) Optimal two-stage algorithms for group testing problems. SIAM J Comput 34:1253-1270
9. Du DZ, Hwang FK (2000) Combinatorial group testing and its applications, 2nd ed. World Scientific, Singapore
10. D'yachkov AG, Rykov VV (1983) A survey of superimposed code theory. Probl Control Inf Theory 12:229-242
11. D'yachkov AG, Macula AJ, Torney DC, Vilenkin PA (2001) Two models of nonadaptive group testing for designing screening experiments. In: Attkinson AC, Hackl P, Muller WG (eds) Proceedings of the 6th international workshop in model oriented design and analysis. Physica, Berlin, pp 63-75
12. D'yachkov AG, Vilenkin PA, Macula AJ, Torney DC (2002) Families of finite sets in which no intersection of sets is covered by the union of s others. J Comb Theory Ser A 99:195-218
13. Farach M, Kannan S, Knill E, Muthukrishnan S (1997) Group testing problem with sequences in experimental molecular biology. In: Proceedings of the compression and complexity of sequences, pp 357-367
14. Hwang FK, Liu YC (2003) Error-tolerant pooling designs with inhibitors. J Comput Biol 10:231-236
15. Kim HK, Lebedev V (2004) On optimal superimposed codes. J Comb Des 12:79-91
16. Macula AJ, Popyack LJ (2004) A group testing method for finding patterns in data. Discret Appl Math 144:149-157
17. Mitchell CJ, Piper FC (1988) Key storage in secure networks. Discret Appl Math 21:215-228
18. Ngo HQ, Du DZ (2000) A survey on combinatorial group testing algorithms with applications to DNA library screening. In: DIMACS Ser Discret Math Theor Comput Sci, vol 55,. American Mathematical Society, Providence, pp 171-182
19. Stinson DR, Wei R (2004) Generalized cover-free families. Discret Math 279:463-477
20. Stinson DR, Wei R, Zhu L (2000) Some new bounds for cover-free families. J Comb Theory Ser A 90:224-234
21. Torney DC (1999) Sets pooling designs. Ann Comb 3:95-101