Group Testing with Multiple Mutually-Obscuring Positives
From MaRDI portal
Publication:4915257
DOI10.1007/978-3-642-36899-8_28zbMath1309.05039OpenAlexW129132415MaRDI QIDQ4915257
Publication date: 9 April 2013
Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_28
Other designs, configurations (05B30) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized group testing for mutually obscuring defectives
- Improved constructions for non-adaptive threshold group testing
- Reconstruction of hidden graphs and threshold group testing
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Nonadaptive algorithms for threshold group testing
- Sets pooling designs
- Generalized cover-free families.
- Some new bounds for cover-free families
- New combinatorial structures with applications to efficient group testing with inhibitors
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
- Learning a Hidden Matching
- Optimal Two-Stage Algorithms for Group Testing Problems
- Learning a Hidden Subgraph
- Nonrandom binary superimposed codes
- Threshold Group Testing
This page was built for publication: Group Testing with Multiple Mutually-Obscuring Positives
