Group Testing With Random Pools: Optimal Two-Stage Algorithms

DOI10.1109/TIT.2010.2103752zbMATH Open1366.62152OpenAlexW2113056523MaRDI QIDQ5281052FDOQ5281052

Authors Marc Mézard, Cristina Toninelli 

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/tit.2010.2103752

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Paired and multiple comparisons; multiple testing (62J15)

Recommendations

• Optimal Two-Stage Algorithms for Group Testing Problems
• Group testing with random pools: Phase transitions and optimal strategy
• Group Testing Algorithms: Bounds and Simulations
• Bounds on the efficiency of two-stage group testing
• On optimal nested group testing algorithms
• Efficient group testing algorithms with a constrained number of positive responses
• scientific article; zbMATH DE number 3980896
• Efficient two-stage group testing
• Randomized group testing both query-optimal and minimal adaptive

Cited In (17)

• A zig-zag approach for competitive group testing
• A tractable non-adaptative group testing method for non-binary measurements
• Random and quasi-random designs in group testing
• Trivial two-stage group testing with high error rates
• Optimal Dorfman group testing for symmetric distributions
• Applications of bulk queues to group testing models with incomplete identification
• Deterministic versus randomized adaptive test cover
• Group Testing With Nested Pools
• A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
• Two new perspectives on multi-stage group testing
• A new strongly competitive group testing algorithm with small sequentiality
• Title not available (Why is no real title available?)
• An improved zig zag approach for competitive group testing
• Optimal group testing with processing times and incomplete identification
• Strict group testing and the set basis problem
• Decoding from pooled data: sharp information-theoretic bounds
• Randomized group testing both query-optimal and minimal adaptive

This page was built for publication: Group Testing With Random Pools: Optimal Two-Stage Algorithms

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