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

Abstract Group testing, sometimes called pooling design, has been applied to a variety of problems such as blood testing, multiple access communication, coding theory, among others. Recently, screening experiments in molecular biology has become the most important application. In this paper, we review several models in this application by focusing on decoding, namely, giving a comparative study of how the problem is solved in each of these models.

[1]  Michael S. Waterman,et al.  Genetic mapping and DNA sequencing , 1996 .

[2]  Sampath Kannan,et al.  Group testing problems with sequences in experimental molecular biology , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[3]  Douglas R. Stinson,et al.  Generalized cover-free families , 2004, Discret. Math..

[4]  Arkadii G. D'yachkov,et al.  Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others , 2002, J. Comb. Theory A.

[5]  Annalisa De Bonis,et al.  Improved Algorithms for Group Testing with Inhibitors , 1998, Inf. Process. Lett..

[6]  Ding-Zhu Du,et al.  A Survey on Combinatorial Group TestingAlgorithms with Applications to DNA , 2004 .

[7]  Anthony J. Macula,et al.  A group testing method for finding patterns in data , 2004, Discret. Appl. Math..

[8]  Hung-Lin Fu,et al.  An upper bound of the number of tests in pooling designs for the error-tolerant complex model , 2008, Optim. Lett..

[9]  Lie Zhu,et al.  Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.

[10]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[11]  Chris J. Mitchell,et al.  Key storage in secure networks , 1988, Discret. Appl. Math..

[12]  Frank K. Hwang,et al.  Error-Tolerant Pooling Designs with Inhibitors , 2003, J. Comput. Biol..

[13]  Ding-Zhu Du,et al.  An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution , 2007, J. Comb. Optim..

[14]  David C. Torney,et al.  Sets pooling designs , 1999 .

[15]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[16]  Noga Alon,et al.  Learning a hidden matching , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Vladimir S. Lebedev,et al.  On optimal superimposed codes , 2004 .

[18]  Emanuel Knill,et al.  A Comparative Survey of Non-Adaptive Pooling Designs , 1996 .

[19]  Annalisa De Bonis,et al.  Optimal Two-Stage Algorithms for Group Testing Problems , 2005, SIAM J. Comput..

[20]  Annalisa De Bonis,et al.  Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels , 2003, Theor. Comput. Sci..

[21]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .