Generalized Framework for Selectors with Applications in Optimal Group Testing

Group Testing refers to the situation in which one is given a set of objects O, an unknown subset P ⊆ O, and the task is to determine P by asking queries of the type "does P intersect Q?", where Q is a subset of O. Group testing is a basic search paradigm that occurs in a variety of situations such as quality control in product testing, searching in storage systems, multiple access communications, and software testing, among the others. Group testing procedures have been recently applied in Computational Molecular Biology, where they are used for screening library of clones with hybridization probes and sequencing by hybridization. Motivated by particular features of group testing algorithms used in biological screening, we study the efficiency of two-stage group testing procedures. Our main result is the first optimal two-stage algorithm that uses a number of tests of the same order as the information theoretic lower bound on the problem. We also provide efficient algorithms for the case in which there is a Bernoulli probability distribution on the possible sets P, and an optimal algorithm for the case in which the outcome of tests may be unreliable because of the presence of "inhibitory" items in O. Our results depend on a combinatorial structure introduced in this paper. We believe that it will prove useful in other contexts too.

[1]  Toby Berger,et al.  Asymptotic efficiency of two-stage disjunctive testing , 2002, IEEE Trans. Inf. Theory.

[2]  Annalisa De Bonis,et al.  Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels , 2002, ESA.

[3]  Steven Skiena,et al.  Reconstructing strings from substrings in rounds , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

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

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

[7]  Peter Damaschke.  Adaptive versus nonadaptive attribute-efficient learning , 1998, STOC '98.

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

[9]  J. Mandell,et al.  Maximally Efficient Two‐Stage Screening , 2000, Biometrics.

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

[11]  Martin Aigner.  Combinatorial search , 1988 .

[12]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[13]  Jaikumar Radhakrishnan,et al.  Deterministic restrictions in circuit complexity , 1996, STOC '96.

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

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

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

[17]  Miklós Ruszinkó,et al.  On the upper bound of the size of the r -cover-free families , 1994 .

[18]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[19]  Andrea E. F. Clementi,et al.  Distributed multi-broadcast in unknown radio networks , 2001, PODC '01.

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

[21]  Toby Berger,et al.  Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing , 2003, Discret. Appl. Math..

[22]  Peter Damaschke.  Parallel Attribute-Efficient Learning of Monotone Boolean Functions , 2000, SWAT.

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

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

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

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

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

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

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

[30]  Michael L. Fredman,et al.  The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..

[31]  Zoltán Füredi.  On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.

[32]  Piotr Indyk,et al.  Deterministic superimposed coding with applications to pattern matching , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[33]  János Komlós,et al.  An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels , 1985, IEEE Trans. Inf. Theory.

[34]  Rudolf Ahlswede,et al.  Search Problems , 1987 .

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

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

[37]  Bruce E. Hajek,et al.  Review of 'Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory' (Kushner, H.J.; 1984) , 1985, IEEE Transactions on Information Theory.

[38]  Amit Sahai,et al.  Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.

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

[40]  S. Wei.  Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures , 1997 .

[41]  D. Angluin.  Queries and Concept Learning , 1988 .

[42]  Peter Damaschke.  Computational Aspects of Parallel Attribute-Efficient Learning , 1998, ALT.

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

[44]  Piotr Indyk,et al.  Explicit constructions of selectors and related combinatorial structures, with applications , 2002, SODA '02.

[45]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[46]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.