A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
From MaRDI portal
Publication:2061995
DOI10.1007/978-3-030-74432-8_4zbMATH Open1480.92127OpenAlexW3134607651MaRDI QIDQ2061995FDOQ2061995
Authors: Yining Liu, Sachin Kadyan, Itsik Pe'er 
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1101/2021.03.09.21253193
Recommendations
- Noisy Adaptive Group Testing: Bounds and Algorithms
- Group Testing With Random Pools: Optimal Two-Stage Algorithms
- Noise-resilient group testing: limitations and constructions
- Noise-Resilient Group Testing: Limitations and Constructions
- Efficient Algorithms for Noisy Group Testing
- Group Testing With Probabilistic Tests: Theory, Design and Application
- Nonadaptive Group Testing Based on Sparse Pooling Graphs
- Optimal non-adaptive probabilistic group testing in general sparsity regimes
- Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing
- Noisy Adaptive Group Testing via Noisy Binary Search
Applications of statistics to biology and medical sciences; meta analysis (62P10) Medical epidemiology (92C60)
Cites Work
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Nonadaptive Group Testing With Random Set of Defectives
- Boolean Compressed Sensing and Noisy Group Testing
- Group testing: an information theory perspective
- Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing
- Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
- On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
Cited In (2)
This page was built for publication: A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061995)
