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

DOI10.1016/S0012-365X(02)00815-4zbMath1028.05015MaRDI QIDQ1810653

Vladimir I. Levenshtein

Publication date: 9 June 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coveringposetSteiner systemuniversal boundpool testing

Mathematics Subject Classification ID

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

Related Items (2)

Efficient two-stage group testing algorithms for genetic screening ⋮ Steiner systems for two-stage disjunctive testing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Association schemes and t-designs in regular semilattices
• A class of Steiner 4-wise balanced designs derived from preparata codes
• Proper S(t, K,v)'s for t ≥ 3,v ≤ 16, |K| > 1 and Their Extensions
• Asymptotic efficiency of two-stage disjunctive testing
• Nonrandom binary superimposed codes
• Efficient reconstruction of sequences from their subsequences of supersequences

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