Two new perspectives on multi-stage group testing
From MaRDI portal
Publication:378258
Recommendations
- Randomized group testing both query-optimal and minimal adaptive
- A toolbox for provably optimal multistage strict group testing strategies
- Strict group testing and the set basis problem
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Bounds for nonadaptive group tests to estimate the amount of defectives
Cites work
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 3801449 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A Sequential Method for Screening Experimental Variables
- A canonical form for testing Boolean function properties
- A short proof of Sperner's lemma
- Combinatorial Group Testing for Corruption Localizing Hashing
- Computational Science – ICCS 2005
- Group Testing With Random Pools: Optimal Two-Stage Algorithms
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Improved Results for Competitive Group Testing
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- Incomplete identification models for group-testable items
- Matroids and the greedy algorithm
- On the cut-off point for combinatorial group testing
- On the upper bound of the size of the \(r\)-cover-free families
- Optimal Two-Stage Algorithms for Group Testing Problems
- Optimal pooling designs with error detection
- Overlaps help: Improved bounds for group testing with interval queries
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Randomized group testing both query-optimal and minimal adaptive
- The minimal number of basic elements in a multiset antichain
- Three theorems regarding testing graph properties
- When is individual testing optimal for nonadaptive group testing?
Cited in
(23)- A class of asymptotically optimal group testing strategies to identify good items
- Informative group testing for multiplex assays
- A class of asymptotically optimal group screening strategies with limited item participation
- Strict group testing and the set basis problem
- Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
- On multistage group screening designs
- scientific article; zbMATH DE number 5262866 (Why is no real title available?)
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Smart elements in combinatorial group testing problems with more defectives
- Trivial two-stage group testing with high error rates
- scientific article; zbMATH DE number 5017180 (Why is no real title available?)
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
- A toolbox for provably optimal multistage strict group testing strategies
- Born again group testing: Multiaccess communications
- On optimal randomized group testing with one defective item and a constrained number of positive responses
- Rounds in a combinatorial search problem
- Adaptive group testing with a constrained number of positive responses improved
- Smart elements in combinatorial group testing problems
- Bounds for nonadaptive group tests to estimate the amount of defectives
- An improved zig zag approach for competitive group testing
- 2-Stage Fault Tolerant Interval Group Testing
- Randomized group testing both query-optimal and minimal adaptive
- Pharmaceutical Applications of a Multi-Stage Group Testing Method
This page was built for publication: Two new perspectives on multi-stage group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378258)