Group Testing With Random Pools: Optimal Two-Stage Algorithms
From MaRDI portal
Publication:5281052
DOI10.1109/TIT.2010.2103752zbMath1366.62152OpenAlexW2113056523MaRDI QIDQ5281052
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
Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Paired and multiple comparisons; multiple testing (62J15)
Related Items
Randomized Group Testing Both Query-Optimal and Minimal Adaptive, Deterministic versus randomized adaptive test cover, Random and quasi-random designs in group testing, A Zig-Zag Approach for Competitive Group Testing, Two new perspectives on multi-stage group testing, A tractable non-adaptative group testing method for non-binary measurements, An improved zig zag approach for competitive group testing, Strict group testing and the set basis problem, A new strongly competitive group testing algorithm with small sequentiality, Decoding from Pooled Data: Sharp Information-Theoretic Bounds