A new strongly competitive group testing algorithm with small sequentiality

In many fault detection problems, we want to identify all defective items from a sample set of items using the minimum number of tests. Group testing is for the scenario where each test is performed on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number of defective items in the sample set is usually unknown. In this paper, we investigate new algorithms for the group testing problem with unknown number of defective items. We consider the scenario where the performance of a group testing algorithm is measured by two criteria: the primary criterion is the number of tests performed, which measures the total cost spent; and the secondary criterion is the number of stages the algorithm works in, which is referred to as the sequentiality of the algorithm in this paper and measures the minimum amount of time required by using the algorithm to identify all the defective items. We present a new algorithm Recursive Binary Splitting (RBS) for the above group testing problem with unknown number of defective items, and prove an upper bound on the number of tests required by RBS. The computational results show that RBS exhibits very good practical performance, measured in terms of both the above two criteria.

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

[2]  Guoliang Xue,et al.  Modifications of Competitive Group Testing , 1994, SIAM J. Comput..

[3]  Andrew B. Kahng,et al.  New and improved BIST diagnosis methods from combinatorial Group testing theory , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Yin-Feng Xu,et al.  A Zig-Zag Approach for Competitive Group Testing , 2014, INFORMS J. Comput..

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

[6]  David Eppstein,et al.  Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes , 2005, SIAM J. Comput..

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

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

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

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

[11]  Lawrence M. Wein,et al.  Pooled Testing for HIV Screening: Capturing the Dilution Effect , 2018, Oper. Res..

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

[13]  Marc Mézard,et al.  Group Testing With Random Pools: Optimal Two-Stage Algorithms , 2007, IEEE Transactions on Information Theory.

[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]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.

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

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

[19]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

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

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

[22]  Shay Kutten,et al.  A New Competitive Algorithm for Group Testing , 1994, Discret. Appl. Math..

[23]  Ding-Zhu Du,et al.  On Competitive Group Testing , 1994, SIAM J. Comput..

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

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

[26]  Ding-Zhu Du,et al.  Competitive Group Testing , 1993, Discret. Appl. Math..

[27]  Eberhard Triesch,et al.  Improved Results for Competitive Group Testing , 2005, Combinatorics, Probability and Computing.

[28]  Atri Rudra,et al.  Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract) , 2011, ICALP.

[29]  Herwig Bruneel,et al.  A queueing model for general group screening policies and dynamic item arrivals , 2010, Eur. J. Oper. Res..

[30]  Anna Scaglione,et al.  On multiple access for distributed dependent sources: a content-based group testing approach , 2004, Information Theory Workshop.

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

[32]  Atri Rudra,et al.  Efficiently decodable non-adaptive group testing , 2010, SODA '10.

[33]  Richard E. Ladner,et al.  Group testing for image compression , 2002, IEEE Trans. Image Process..

[34]  Jose Emmanuel Ramirez-Marquez,et al.  Optimal design of container inspection strategies considering multiple objectives via an evolutionary approach , 2012, Ann. Oper. Res..

[35]  Wolfgang Stadje,et al.  Applications of bulk queues to group testing models with incomplete identification , 2007, Eur. J. Oper. Res..

[36]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

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

[38]  Alexander Dukhovny,et al.  Optimization in HIV screening problems , 2003 .

[39]  Michael T. Goodrich,et al.  Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis , 2009, J. Comb. Optim..

[40]  L. Wein,et al.  Pooled testing for HIV prevalence estimation: exploiting the dilution effect. , 2015, Statistics in medicine.

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

[42]  Jose Emmanuel Ramirez-Marquez,et al.  Optimization of container inspection strategy via a genetic algorithm , 2011, Ann. Oper. Res..

[43]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.