Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find all defectives by using as few tests as possible. We consider a variant of classical group testing in which one is concerned not only with minimizing the total number of tests but aims also at reducing the number of tests involving defective elements. The rationale behind this search model is that in many practical applications the devices used for the tests are subject to deterioration due to exposure to or interaction with the defective elements. In this paper we consider adaptive, non-adaptive and two-stage group testing. For all three considered scenarios, we derive upper and lower bounds on the number of "yes" responses that must be admitted by any strategy performing at most a certain number t of tests. In particular, for the adaptive case we provide an algorithm that uses a number of "yes" responses that exceeds the given lower bound by a small constant. Interestingly, this bound can be asymptotically attained also by our two-stage algorithm, which is a phenomenon analogous to the one occurring in classical group testing. For the non-adaptive scenario we give almost matching upper and lower bounds on the number of "yes" responses. In particular, we give two constructions both achieving the same asymptotic bound. An interesting feature of one of these constructions is that it is an explicit construction. The bounds for the non-adaptive and the two-stage cases follow from the bounds on the optimal sizes of new variants of d-cover free families and (p,d)-cover free families introduced in this paper, which we believe may be of interest also in other contexts.

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

[2]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

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

[4]  Rudolf Ahlswede,et al.  Threshold and Majority Group Testing , 2013, Information Theory, Combinatorics, and Search Theory.

[5]  Emanuel Knill,et al.  Lower bounds for identifying subset members with subset queries , 1994, SODA '95.

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

[7]  Chou Hsiung Li.  A Sequential Method for Screening Experimental Variables , 1962 .

[8]  Mingyan Liu,et al.  Efficient Sensor Fault Detection Using Combinatorial Group Testing , 2013, 2013 IEEE International Conference on Distributed Computing in Sensor Systems.

[9]  Noga Alon,et al.  Learning a Hidden Subgraph , 2004, SIAM J. Discret. Math..

[10]  Peter Damaschke,et al.  Randomized Group Testing Both Query-Optimal and Minimal Adaptive , 2012, SOFSEM.

[11]  Peter Damaschke,et al.  Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection , 2005, International Conference on Computational Science.

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

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

[14]  Peter Damaschke.  Randomized Group Testing for Mutually Obscuring Defectives , 1998, Inf. Process. Lett..

[15]  Miklós Ruszinkó,et al.  On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.

[16]  Annalisa De Bonis.  Efficient Group Testing Algorithms with a Constrained Number of Positive Responses , 2014, COCOA.

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

[18]  F. Hwang.  A Method for Detecting all Defective Members in a Population by Group Testing , 1972 .

[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]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

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

[23]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[24]  Ely Porat,et al.  Search Methodologies , 2022 .

[25]  Eberhard Triesch,et al.  Two New Perspectives on Multi-Stage Group Testing , 2013, Algorithmica.

[26]  Peter Damaschke,et al.  Optimal group testing algorithms with interval queries and their application to splice site detection , 2005, Int. J. Bioinform. Res. Appl..

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

[28]  Weili Wu,et al.  Non-unique probe selection and group testing , 2007, Theor. Comput. Sci..

[29]  Annalisa De Bonis,et al.  An Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors , 2011, J. Comput. Biol..

[30]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[31]  B S Pasternack,et al.  Application of group testing procedures in radiological health. , 1973, Health physics.

[32]  Ely Porat,et al.  Explicit Nonadaptive Combinatorial Group Testing Schemes , 2011, IEEE Trans. Inf. Theory.

[33]  Rudolf Ahlswede,et al.  Bounds for threshold and majority group testing , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[34]  Annalisa De Bonis,et al.  Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes , 2006, IEEE Transactions on Information Theory.

[35]  Siu-Ming Yiu,et al.  Non-adaptive Complex Group Testing with Multiple Positive Sets , 2011, TAMC.

[36]  D. Bohning,et al.  Group-Sequential Leak-Testing of Sealed Radium Sources , 1976 .