An upper bound of the number of tests in pooling designs for the error-tolerant complex model

DOI10.1007/s11590-007-0070-5zbMath1144.92309OpenAlexW2003144957MaRDI QIDQ941032

Hong-Bin Chen, Frank K. Hwang, Hung-Lin Fu

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-007-0070-5

zbMATH Keywords

group testingdisjunct matricesnonadaptive algorithms

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90) Biochemistry, molecular biology (92C40)

Related Items (10)

Improved constructions for non-adaptive threshold group testing ⋮ Unnamed Item ⋮ An extension of Stein-Lovász theorem and some of its applications ⋮ An adaptive algorithm for group testing for complexes ⋮ Threshold and Majority Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Error-correcting pooling designs associated with some distance-regular graphs ⋮ A class of error-correcting pooling designs over complexes ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ Nonadaptive algorithms for threshold group testing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• On the ratio of optimal integral and fractional covers
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Sets pooling designs
• Trivial two-stage group testing for complexes using almost disjunct matrices.
• Generalized cover-free families.
• A group testing method for finding patterns in data
• Some new bounds for cover-free families
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• Interval Packing and Covering in the Boolean Lattice
• On optimal superimposed codes
• Learning a Hidden Matching
• Explicit constructions of perfect hash families from algebraic curves over finite fields

This page was built for publication: An upper bound of the number of tests in pooling designs for the error-tolerant complex model