Application of cover-free codes and combinatorial designs to two-stage testing

Authors:
Toby Berger;Vladimir I. Levenshtein
Affiliations:
School of Electrical Engineering, Cornell University, Ithaca, NY;Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, Miusskaya sq. 4, 125047, Moscow, Russia
Venue:
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Year:
2003

Citing 4
Cited 1

Optimal pooling designs with error detection

Journal of Combinatorial Theory Series A
Lower bounds for identifying subset members with subset queries

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Upper bounds for constant-weight codes

IEEE Transactions on Information Theory
Asymptotic efficiency of two-stage disjunctive testing

IEEE Transactions on Information Theory

Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study combinatorial and probabilistic properties of cover-free codes and block designs which are useful for their efficient application as the first stage of two-stage group testing procedures. Particular attention is paid to these procedures because of their importance in such applications as monoclonal antibody generation and cDNA library screening.