Asymptotic efficiency of two-stage disjunctive testing

DOI10.1109/TIT.2002.1013122zbMATH Open1060.62005MaRDI QIDQ4674541FDOQ4674541

Authors: Toby Berger, Vladimir Levenshtein 

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Efficient two-stage group testing
• Optimal Two-Stage Algorithms for Group Testing Problems
• Optimal group testing
• Maximally Efficient Two‐Stage Screening
• Algorithms and Data Structures

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Parametric hypothesis testing (62F03)

Cited In (8)

• Optimal group testing
• A universal bound for a covering in regular posets and its application to pool testing
• Optimal Dorfman group testing for symmetric distributions
• Application of cover-free codes and combinatorial designs to two-stage testing.
• Title not available (Why is that?)
• Asymptotic analysis of optimal nested group-testing procedures
• Group testing with random pools: Phase transitions and optimal strategy
• Efficient two-stage group testing algorithms for genetic screening

This page was built for publication: Asymptotic efficiency of two-stage disjunctive testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674541)