An adaptive algorithm for group testing for complexes
From MaRDI portal
Publication:500957
DOI10.1016/j.tcs.2015.05.005zbMath1330.68107OpenAlexW242605419MaRDI QIDQ500957
Lucia Moura, Jacob Chodoriwsky
Publication date: 8 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.005
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Search problems on graphs
- Sets pooling designs
- A group testing problem for hypergraphs of bounded rank
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
- A survey on nonadaptive group testing algorithms through the angle of decoding
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Logarithmic order of free distributive lattice
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
- Maximally Efficient Two‐Stage Screening
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set