Lower bounds for identifying subset members with subset queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 369-377

  Knill, E ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COST EFFECTIVENESS; FAULT DETECTION; SET THEORY;

ARBITRARY DISTRIBUTION; AVERAGE NUMBERS; HIGH PROBABILITY; INDIVIDUAL OBJECTS; MULTI-ACCESS COMMUNICATIONS; NONADAPTIVE ALGORITHM; RELAXATION TECHNIQUES; TWO-STAGE ALGORITHM;

BIOINFORMATICS;

EID: 49149091030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D.J. Balding, D.C. Torney, Optimal pooling designs with error detection, J. Comb. Th. A (to appear) (1994).
2. D.J. Balding, W.J. Bruno, E. Knill, D.C. Torney, A comparative survey of non-adaptive pooling designs, preprint.
3. E. Barillot, B. Lacroix and D. Cohen, Theoretical analysis of library screening using an N-dimensional pooling strategy, Nucleic Acids Research 19, 62416247 (1991)
4. W.J. Bruno, D.J. Balding, E. Knill, D. Torney, D. Bruce, C. Whittaker, N. Doggett, R. Stallings, Design of efficient pooling experiments, preprint.
5. R. Dorfman, The detection of defective members of large populations, Ann. Math. Statist. 14, 436-440 (1943).
6. D.-Z. Du, F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific Publishing Co., Singapore (1993).
7. A.G. Dyachov, Bounds on the error probability for certain ensembles of random codes (Russian), Problemy Peredachi Informatsii 15, 23-35 (1979).
8. A.G. Dyachov, Error probability bounds for two models of randomized design of elimination experiments (Russian), Problemy Peredachi Informatsii 15, 17-31 (1979).
9. A.G. Dyachov, V.V Rykov, Bounds on the length of disjunctive codes (Russian), Problemy Peredachi Informatsii 18, 7-13 (1980).
10. A.G. Dyachov, V.V. Rykov, A survey of superimposed code theory, Problems of Control and Information Theory 12, 1-13 (1983).
11. A.G. Dyachov, V.V. Rykov, A.M. Rashad, Superimposed distance codes, Problems of Control and Information Theory 18, 237-250 (1989).
12. P. Erdös, P. Frankl, Z. Furedi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math. 51, 79-89 (1985).
13. F.K. Hwang, Robust Group Testing. J. of Quality Technology 16, 189-195 (1984).
14. F.K. Hwang, V.T. Sós, Non-adaptive hypergeometric group testing, Stud. Sei. Math. Hung. 22, 257-263 (1987) .
15. W.H. Kautz, R.C. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory 10, 363-377 (1964).
16. C.H. Li, A sequential method for screening experimental variables, J. Amer. Statist. Assoc. 57, 455-477 (1962).
17. D. Kurtz, M. Sidi, Multiple-access algorithms via group testing for heterogeneous population of users, IEEE Transactions on Communications 36, 1316-1323 (1988) .
18. S. Muthukrishnan, On optimal strategies for searching in the presence of errors, Proc. 5th Annual AC M-SIAM Symp. on Discrete Algorithms, 680-689 (1993).
19. H. Schneider, K. Tang, Adaptive procedures for the two-stage group-testing problem based on prior distributions and costs, Technometrics 32, 397-405 (1990).
20. M. Sobel, P.A. Groll, Group testing to eliminate efficiently all defectives in a binomial sample, Bell System Tech. J. 28, 1179-1252 (1959).
21. J.K. Wolf, Born again group testing: multiaccess communications, IEEE Trans. Inf. Th. IT-31, 185-191 (1985).