Asymptotics of pooling design performance

DOI10.1239/JAP/1032374746MaRDI QIDQ4954228zbMATH OpenOpenAlexFDO

Authors

Publication date 2 September 2001

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1239/jap/1032374746

zbMATH Keywords

randomizationasymptotic analysiscombinatorial designsapproximation techniquesgroup testing designs

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Combinatorial probability (60C05) Designs and configurations (05B99)

Recommendations

• Pooling designs associated with unitary space and ratio efficiency comparison
• Performance bounds for the effectiveness of pooling in multi-processing systems
• Optimal pooling designs with error detection
• Approaching pooling design with smaller efficient ratio
• scientific article; zbMATH DE number 956611
• Complexity analysis and algorithm design of pooling problem
• Random pooling designs under various structures
• Some results on pooling

Cited in

(7)

• Pooling, lattice square, and union jack designs
• Some results on pooling
• A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS
• Pooling designs associated with unitary space and ratio efficiency comparison
• The identification of positive clones in a general inhibitor model
• On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
• Sets pooling designs

This page was built for publication: Asymptotics of pooling design performance

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