Non-adaptive complex group testing with multiple positive sets

DOI10.1016/J.TCS.2013.04.011MaRDI QIDQ393127zbMATHOpenAlexFDO

Authors Francis Y. L. Chin, Henry Leung, S. M. Yiu

Publication date 16 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.04.011

zbMATH Keywords

combinatorial group testingknock-out studynon-adaptive complex group testingpooling design

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Recommendations

• Non-adaptive complex group testing with multiple positive sets
• An adaptive algorithm for group testing for complexes
• Subquadratic non-adaptive threshold group testing
• Trivial two-stage group testing for complexes using almost disjunct matrices.
• Bounds for the number of tests in non-adaptive randomized algorithms for group testing

Cites work

• scientific article; zbMATH DE number 3831842 (Why is no real title available?)
• scientific article; zbMATH DE number 1256716 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 5262869 (Why is no real title available?)
• A Method for Detecting All Defective Members in a Population by Group Testing
• A Sequential Method for Screening Experimental Variables
• Algorithmic construction of sets for k -restrictions
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
• Efficiently decodable non-adaptive group testing
• Explicit Non-adaptive Combinatorial Group Testing Schemes
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Generalized cover-free families.
• Hypothesis group testing for disjoint pairs
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• Improved construction for pooling design
• New combinatorial structures with applications to efficient group testing with inhibitors
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

Cited in

(13)

• Non-adaptive randomized algorithm for group testing
• A class of asymptotically optimal group testing strategies to identify good items
• A class of asymptotically optimal group screening strategies with limited item participation
• Exact learning from an honest teacher that answers membership queries
• Equitable induced decompositions of twin graphs
• Almost optimal cover-free families
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Non-adaptive complex group testing with multiple positive sets
• On optimal randomized group testing with one defective item and a constrained number of positive responses
• An adaptive algorithm for group testing for complexes
• Non-adaptive learning of a hidden hypergraph
• Non-adaptive learning of a hidden hypergraph

This page was built for publication: Non-adaptive complex group testing with multiple positive sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393127)