Group Testing With Probabilistic Tests: Theory, Design and Application

Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items into different pools and detecting defective members based on the set of test results obtained for each pool. In a classical noiseless group testing setup, it is assumed that the sampling procedure is fully known to the reconstruction algorithm, in the sense that the existence of a defective member in a pool results in the test outcome of that pool to be positive. However, this may not be always a valid assumption in some cases of interest. In particular, we consider the case where the defective items in a pool can become independently inactive with a certain probability. Hence, one may obtain a negative test result in a pool despite containing some defective items. As a result, any sampling and reconstruction method should be able to cope with two different types of uncertainty, i.e., the unknown set of defective items and the partially unknown, probabilistic testing procedure. In this work, motivated by the application of detecting infected people in viral epidemics, we design nonadaptive sampling procedures that allow successful identification of the defective items through a set of probabilistic tests. Our design requires only a small number of tests to single out the defective items. In particular, for a population of size N and at most K defective items with activation probability p, our results show that M = O(K2 log (N/K)/p3) tests is sufficient if the sampling procedure should work for all possible sets of defective items, while M = O(K log (N)/p3) tests is enough to be successful for any single set of defective items. Moreover, we show that the defective members can be recovered using a simple reconstruction algorithm with complexity of O(MN).

[1]  Jack K. Wolf,et al.  Born again group testing: Multiaccess communications , 1985, IEEE Trans. Inf. Theory.

[2]  Martin J. Wainwright,et al.  Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices , 2008, IEEE Transactions on Information Theory.

[3]  A. Sterrett On the Detection of Defective Members of Large Populations , 1957 .

[4]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[5]  J. Hadamard,et al.  Lectures on Cauchy's Problem in Linear Partial Differential Equations , 1924 .

[6]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[7]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[8]  Graham Cormode,et al.  Combinatorial Algorithms for Compressed Sensing , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[9]  Galen Reeves,et al.  Sampling bounds for sparse support recovery in the presence of noise , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  J. CandesE.,et al.  Robust uncertainty principles , 2006 .

[11]  A.C. Gilbert,et al.  Group testing and sparse signal recovery , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[12]  Vahid Tarokh,et al.  Shannon-Theoretic Limits on Noisy Compressive Sampling , 2007, IEEE Transactions on Information Theory.

[13]  M. Sobel,et al.  Group testing to eliminate efficiently all defectives in a binomial sample , 1959 .

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

[15]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[16]  F. K. Hwang,et al.  Group testing with a dilution effect , 1976 .

[17]  Andrew B. Kahng,et al.  Combinatorial group testing methods for the BIST diagnosis problem , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).

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

[19]  Anthony J. Macula,et al.  Probabilistic Nonadaptive and Two-Stage Group Testing with Relatively Small Pools and DNA Library Screening , 1998, J. Comb. Optim..

[20]  Mark A. Iwen,et al.  A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods , 2007, SODA '08.

[21]  Alexander Schliep,et al.  Group testing with DNA chips: generating designs and decoding experiments , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[22]  Sundeep Rangan,et al.  Necessary and Sufficient Conditions for Sparsity Pattern Recovery , 2008, IEEE Transactions on Information Theory.

[23]  R. Dorfman The Detection of Defective Members of Large Populations , 1943 .

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

[25]  Amin Karbasi,et al.  Compressed sensing with probabilistic measurements: A group testing solution , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[26]  D. Du,et al.  Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .

[27]  Ding-Zhu Du,et al.  New Constructions of One- and Two-Stage Pooling Designs , 2008, J. Comput. Biol..

[28]  Zoltán Füredi,et al.  Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

[29]  Andreas Blass,et al.  Pairwise Testing , 2002, Bull. EATCS.

[30]  Anna C. Gilbert,et al.  Analysis of Data Streams: Computational and Algorithmic Challenges , 2007, Technometrics.

[31]  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.

[32]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, PODS '03.

[33]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[34]  Richard E. Ladner,et al.  Group testing for image compression , 2000, Proceedings DCC 2000. Data Compression Conference.

[35]  Ely Porat,et al.  k -Mismatch with Don't Cares , 2007, ESA.

[36]  M. Strauss GROUP TESTING IN STATISTICAL SIGNAL RECOVERY , 2006 .

[37]  Pavel A. Pevzner,et al.  Towards DNA Sequencing Chips , 1994, MFCS.