Asymptotic efficiency of two-stage disjunctive testing

IEEE Transactions on Information Theory

Volumn 48, Issue 7, 2002, Pages 1741-1749

  Berger, Toby ^a,b   Levenshtein, Vladimir I ^a,c  

^a IEEE   (United States)

^b Cornell University   (United States)

^c KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

Cover free codes; Disjunctive testing; Linear programming; Pool testing; Random selection; Reconstruction algorithms; Screening

Indexed keywords

DISJUNCTIVE TESTING;

ALGORITHMS; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

CODES (SYMBOLS);

EID: 0036649488     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1013122     Document Type: Article

References (23)

1. Theoretical analysis of library screening using an N-dimensional pooling strategy
2. Random multiple-access communication and group testing
3. Maximally efficient two-stage group testing
4. Application of cover-free codes and combinatorial block-designs to two-stage testing
5. A survey of superimposed distance codes
6. The detection of defective members of large populations
7. On two problems of information theory
8. Non-adaptive hypergeometric group testing
9. Nonrandom binary superimposed codes
10. Lower bounds for identifying subset members with subset queries
11. Efficient reconstruction of sequences
12. A universal bound for a covering in regular posets and its application to pool testing
13. A sequential method for screening experimental variables
14. Multiple-access algorithms via group testing for heterogeneous population of users
15. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
16. Bounds on constant weight binary superimposed codes
17. A mathematical theory of communication
18. Group testing to eliminate efficiently all defectives in a binomial sample
19. Born again group testing: Multiaccess communications