Non-adaptive Complex Group Testing with Multiple Positive Sets

DOI10.1007/978-3-642-20877-5_19zbMath1331.68205OpenAlexW2168269159MaRDI QIDQ3010399

Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/135706

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)

Cites Work

• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Generalized cover-free families.
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• Hypothesis group testing for disjoint pairs
• New combinatorial structures with applications to efficient group testing with inhibitors
• Improved construction for pooling design
• A Sequential Method for Screening Experimental Variables
• Explicit Non-adaptive Combinatorial Group Testing Schemes
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• A Method for Detecting All Defective Members in a Population by Group Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-adaptive Complex Group Testing with Multiple Positive Sets