A survey on combinatorial group testing algorithms with applications to DNA Library Screening

In this paper, we give an overview of Combinatorial Group Testing algo- rithms which are applicable to DNA Library Screening. Our survey focuses on several classes of constructions not discussed in previous surveys, provides a general view on pooling design constructions and poses several open questions arising from this view.

[1]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[2]  D. Balding,et al.  Efficient pooling designs for library screening. , 1994, Genomics.

[3]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[4]  Joel H. Spencer,et al.  Ulam's Searching Game with a Fixed Number of Lies , 1992, Theor. Comput. Sci..

[5]  V. V. Rykov,et al.  Superimposed distance codes , 1989 .

[6]  Wojciech Guzicki,et al.  Ulam's searching game with two lies , 1990, J. Comb. Theory, Ser. A.

[7]  David C. Torney,et al.  Optimal Pooling Designs with Error Detection , 1994, J. Comb. Theory, Ser. A.

[8]  Andrzej Pelc,et al.  Solution of Ulam's problem on searching with a lie , 1987, J. Comb. Theory, Ser. A.

[9]  L. Hood,et al.  A common language for physical mapping of the human genome. , 1989, Science.

[10]  Martin Aigner,et al.  Searching with Lies , 1996, J. Comb. Theory, Ser. A.

[11]  F. K. Hwang.  An isomorphic factorization of the complete graph , 1995, J. Graph Theory.

[12]  S. Ulam,et al.  Adventures of a Mathematician , 2019, Mathematics: People · Problems · Results.

[13]  Anthony J. Macula,et al.  A simple construction of d-disjunct matrices with certain constant weights , 1996, Discret. Math..

[14]  E. Barillot,et al.  Theoretical analysis of library screening using a N-dimensional pooling strategy. , 1991, Nucleic acids research.

[15]  S. Muthukrishnan,et al.  On optimal strategies for searching in presence of errors , 1994, SODA '94.

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

[17]  A. Sebő.  ON TWO RANDOM SEARCH PROBLEMS , 1985 .

[18]  Andries E. Brouwer,et al.  Optimal Packings of K4's into a Kn , 1979, J. Comb. Theory A.

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

[20]  A. Macula.  Probabilistic nonadaptive group testing in the presence of errors and DNA library screening , 1999 .