Advertisement

Journal of Combinatorial Optimization

, Volume 7, Issue 4, pp 339–352 | Cite as

Random Pooling Designs Under Various Structures

  • F.K. Hwang
  • Y.C. Liu
Article

Abstract

Balding et al. (1995) showed that randomizing over the k-set space yields much better pooling designs than the random pooling design without the k-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 the k-set space, as our guinea pig to compare with the k-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 the k-set space.

random pooling designs clone library screening k-clique 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 in Mathematics and its Applications, Springer Verlag, 1995, pp. 133–155.Google Scholar
  2. 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.Google Scholar
  3. D. Du and F.K. Hwang, Combinatorial Group Testing and its Applications, 2nd edition. World Scientific, 2000.Google Scholar
  4. F.K. Hwang, “Random k-set pool designs with distinct columns,” Prob. Eng. Inform. Sci., vol. 14, pp. 49–56, 2000.Google Scholar
  5. 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.Google Scholar
  6. W.H. Kautz and R.R. Singleton, “Nonrandom binary superimposed codes,” IEEE Trans. Inform. Thy., vol. 10, pp. 363–377, 1964.Google Scholar
  7. A.J. Macula, “Asimple construction of d-disjunct matrices with certain weights,” Disc. Math., vol. 80, pp. 311–312, 1997.Google Scholar
  8. A.J. Macula, “Probabilistic nonadaptive group testing in the presence of errors and DNA library screening,” Ann. Comb., vol. 1, pp. 61–69, 1999.Google Scholar
  9. 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.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • F.K. Hwang
    • 1
  • Y.C. Liu
    • 1
  1. 1.Department of Applied MathematicsNational Chiao Tung UniversityHsinchuTaiwan, ROC

Personalised recommendations