Abstract
We use a simple, but nonstandard, incidence relation to construct probabilistic nonadaptive group testing algorithms that identify many positives in a population with a zero probability of yielding a false positive. More importantly, we give two-stage modifications of our nonadaptive algorithms that dramatically reduce the expected number of sufficient pools. For our algorithms, we give a lower bound on the probability of identifying all the positives and we compute the expected number of positives identified. Our method gives control over the pool sizes. In DNA library screening algorithms, where relatively small pools are generally preferred, having control over the pool sizes is an important practical consideration.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.J. Balding and D.C. Torney, “Optimal pooling designs with error detection,” J. Combinatorial Th. A., vol. 74, 1996.
D.J. Balding et al., “A comparative survey of non-adaptive pooling designs,” Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and its Applications, Springer Verlag, 1995, pp. 133–155.
W.J. Bruno et al., “Design of efficient pooling experiments,” Genomics, vol. 26, pp. 21–30, 1995.
R. Dorfman, “The detection of defective members of a large population,” Ann. Math. Stat., vol. 14, pp. 436–440, 1943.
D.-Z. Du and F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific: Singapore.
A. D'yachkov, A. Macula, and V. Rykov, “On optimal parameters of a class of superimposed codes and designs,” 1997, submitted.
A. D'yachkov and V. Rykov, “Superimposed distance codes,” Problems Contr. and Inf. Theory, vol. 18, pp. 237–250, 1989.
Farach et al., “Group testing problems in experimental computational biology,” Technical Report LAUR-95–150, Los Alamos National Laboratory, 1994.
N. Johnson and S. Kotz, Urn Models and Their Application, Wiley: New York, 1977.
E. Knill, “Lower bounds for identifying subset members with subset queries,” in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery & Society for Industrial and Applied Mathematics, 1995, pp. 369–377.
E. Knill et al., “Non-adaptive group testing in the presence of errors,” Technical Report LAUR-95–2040, Los Alamos National Laboratory, 1996.
A. Macula, “A simple construction of d-disjunct matrices with certain constant weights, Discrete Mathematics, vol. 162, pp. 311–312, 1996.
A. Macula, “Nonadaptive group testing with error-correcting d-disjunct matrices,” Discrete Applied Mathematics, vol. 80, pp. 217–282, 1997.
A. Macula and G. Reuter, “Simplified searching for two defects,” Journal of Statistical Planning and Inference, vol. 66, pp. 77–82, 1997.
M. Olson et al., “A common language for physical mapping of the human genome,” Science, vol. 245, pp. 7474–7476, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Macula, A.J. Probabilistic Nonadaptive and Two-Stage Group Testing with Relatively Small Pools and DNA Library Screening. Journal of Combinatorial Optimization 2, 385–397 (1998). https://doi.org/10.1023/A:1009732820981
Issue Date:
DOI: https://doi.org/10.1023/A:1009732820981