In this paper, we give an overview of Combinatorial Group Testing algorithms which are applicable to DNA Library Screening. Our survey focuses on several classes of …
Group testing is the problem of identifying K defective items among n items by pooling groups of items. In this paper, we design group testing algorithms for approximate recovery …
Background In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and false …
T Huang, C Weng - Discrete Mathematics, 2004 - Elsevier
A pooling space is defined to be a ranked partially ordered set with atomic intervals. We show how to construct non-adaptive pooling designs from a pooling space. Our pooling …
Y Cheng, DZ Du - Journal of Computational Biology, 2008 - liebertpub.com
The study of gene functions requires a DNA library of high quality, such a library is obtained from a large mount of testing and screening. Pooling design is a very helpful tool for …
A D'yachkov, F Hwang, A Macula… - Journal of …, 2005 - liebertpub.com
The screening of data sets for" positive data objects" is essential to modern technology. A (group) test that indicates whether a positive data object is in a specific subset or pool of the …
AG D'yachkov, AJ Macula, PA Vilenkin - Entropy, search, complexity, 2007 - Springer
Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting de -Disjunct Inclusion Matrices Page 1 BOLYAI SOCIETY Entropy, Search, Complexity, pp. 71–83 …
M Csros, M Ruszinkó - IEEE transactions on information theory, 2005 - ieeexplore.ieee.org
The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n]={1,..., n} is an r-single-user-tracing superimposed code (r-SUT) if …