A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
From MaRDI portal
Publication:2061995
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
Cites work
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- Boolean Compressed Sensing and Noisy Group Testing
- Group testing: an information theory perspective
- Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
- Nonadaptive Group Testing With Random Set of Defectives
- Nonrandom binary superimposed codes
- On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Rapid, large-scale, and effective detection of COVID-19 via non-adaptive 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)