A universal bound for a covering in regular posets and its application to pool testing

DOI10.1016/S0012-365X(02)00815-4MaRDI QIDQ1810653zbMATH OpenFDO

Authors Vladimir Levenshtein

Publication date 9 June 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(02)00815-4

zbMATH Keywords

coveringpool testingposetSteiner systemuniversal bound

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Parametric hypothesis testing (62F03) Testing in survival analysis and censored data (62N03) Linear programming (90C05)

Recommendations

• Sets pooling designs
• Optimal pooling designs with error detection
• scientific article; zbMATH DE number 956611
• Asymptotic efficiency of two-stage disjunctive testing
• More on pooling spaces

Cites work

• A class of Steiner 4-wise balanced designs derived from preparata codes
• Association schemes and t-designs in regular semilattices
• Asymptotic efficiency of two-stage disjunctive testing
• Efficient reconstruction of sequences from their subsequences of supersequences
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 53885 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• scientific article; zbMATH DE number 910893 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Nonrandom binary superimposed codes
• Proper S(t, K,v)'s for t ≥ 3,v ≤ 16, |K| > 1 and Their Extensions

Cited in

(3)

• An extension of Stein-Lovász theorem and some of its applications
• Steiner systems for two-stage disjunctive testing
• Efficient two-stage group testing algorithms for genetic screening

This page was built for publication: A universal bound for a covering in regular posets and its application to pool testing

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