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

DOI10.1007/S11590-007-0070-5MaRDI QIDQ941032zbMATH OpenOpenAlexFDO

Authors Hongbin Chen, Hung-Lin Fu, Frank K. Hwang

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

disjunct matricesgroup testingnonadaptive algorithms

Mathematics Subject Classification ID

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

Recommendations

• Pooling designs for clone library screening in the inhibitor complex model
• Improved construction for pooling design
• Non-adaptive group testing in the presence of errors
• Error-tolerance pooling design in a finite vector space.
• Sets pooling designs

Cites work

• A group testing method for finding patterns in data
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Families of finite sets in which no intersection of sets is covered by the union of s others
• Generalized cover-free families.
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 5262866 (Why is no real title available?)
• scientific article; zbMATH DE number 956611 (Why is no real title available?)
• Interval packing and covering in the Boolean lattice
• Learning a Hidden Matching
• On optimal superimposed codes
• On the ratio of optimal integral and fractional covers
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Sets pooling designs
• Some new bounds for cover-free families
• Trivial two-stage group testing for complexes using almost disjunct matrices.

Cited in

(10)

• Nonadaptive algorithms for threshold group testing
• An extension of Stein-Lovász theorem and some of its applications
• Competitive group testing and learning hidden vertex covers with minimum adaptivity
• Threshold and Majority Group Testing
• Group Testing with Multiple Mutually-Obscuring Positives
• Error-tolerant non-adaptive learning of a hidden hypergraph
• An adaptive algorithm for group testing for complexes
• Pooling designs for clone library screening in the inhibitor complex model
• Error-correcting pooling designs associated with some distance-regular graphs
• A class of error-correcting pooling designs over complexes

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

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