120Accesses
7Citations
3Altmetric
Abstract
Balding et al. (1995) showed that randomizing over thek-set space yields much better pooling designs than the random pooling design without thek-restriction. A natural question arises as to whether a smaller subspace, i.e., a space with more structure, will yield even better results. We take the random subset containment design recently proposed by Macula, which randomizes over a subspace of thek-set space, as our guinea pig to compare with thek-set space. Unfortunately the performance of the subset containment design is hard to analyze and only approximations are given. For a set of parameters, we are able to produce either an exact analysis or very good approximations. The comparisons under these parameters seem to favor thek-set space.
This is a preview of subscription content,log in via an institution to check access.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price includes VAT (Japan)
Instant access to the full article PDF.
Similar content being viewed by others
References
D.J. Balding, W.J. Bruno, E. Knill, and D.C. Torney, “A comparative survey of non-adaptive pooling designs,”Genetic Mapping and DNA Sequencing, IMA Volumes inMathematics and its Applications, Springer Verlag, 1995, pp. 133–155.
W.J. Bruno, E. Knill, D.J. Balding, D.C. Bruce, N.A. Doggett, W.W. Sawhill, R.L. Stalling, C.C. Whittaker, and D.C. Torney, “Efficient pooling designs for library screening,”Genomics, vol. 26, pp. 21–30, 1995.
D. Du and F.K. Hwang,Combinatorial Group Testing and its Applications, 2nd edition. World Scientific, 2000.
F.K. Hwang, “Randomk-set pool designs with distinct columns,”Prob. Eng. Inform. Sci., vol. 14, pp. 49–56, 2000.
F.K. Hwang and Y.C. Liu, “The expected number of unresolved positive clones in various random pool designs,”Prob. Eng. Inform. Sci., vol. 15, pp. 57–68, 2001.
W.H. Kautz and R.R. Singleton, “Nonrandom binary superimposed codes,”IEEE Trans. Inform. Thy., vol. 10, pp. 363–377, 1964.
A.J. Macula, “Asimple construction ofd-disjunct matrices with certain weights,”Disc. Math., vol. 80, pp. 311–312, 1997.
A.J. Macula, “Probabilistic nonadaptive group testing in the presence of errors and DNA library screening,”Ann. Comb., vol. 1, pp. 61–69, 1999.
H.Q. Ngo and D.Z. Du, “A sruvey on combinatorial group testing algorithms with applications to DNA library screening,”DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 55, Amer. Math. Soc., 2000, pp. 171–182.
Author information
Authors and Affiliations
Department of Applied Mathematics, National Chiao Tung University, Hsinchu, 30050, Taiwan, ROC
F.K. Hwang & Y.C. Liu
- F.K. Hwang
You can also search for this author inPubMed Google Scholar
- Y.C. Liu
You can also search for this author inPubMed Google Scholar
Rights and permissions
About this article
Cite this article
Hwang, F., Liu, Y. Random Pooling Designs Under Various Structures.Journal of Combinatorial Optimization7, 339–352 (2003). https://doi.org/10.1023/B:JOCO.0000017382.83399.0b
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative