Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-07T02:08:48.546Z Has data issue: false hasContentIssue false
  • English
  • Français

A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS

Published online by Cambridge University Press:  16 April 2004

F. K. Hwang  and
Y. C. Liu
F. K. Hwang
Affiliation:
Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050 Taiwan, Republic of China, E-mail: fhwang@math.nctu.edu.tw;, u8722518@math.nctu.edu.tw
Y. C. Liu
Affiliation:
Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050 Taiwan, Republic of China, E-mail: fhwang@math.nctu.edu.tw;, u8722518@math.nctu.edu.tw
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we develop a general approach to compute the probabilities of unresolved clones in random pooling designs. This unified and systematic approach gives better insight for handling the dependency issue among the columns and among the rows. Consequently, we identify some faster computation formulas for four random pooling designs proposed in the literature, and we derive some probability distribution functions of the number of unresolved clones that were not available before.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 18 , Issue 2 , April 2004 , pp. 161 - 183
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Partially supported by Republic of China, National Science Council grant NSC 90-2115-M-009-027.

References

REFERENCES

Balding, D.J., Bruno, W.J., Knill, E., & Torney, D.C. (1995). A comparative survey of non-adaptive pooling designs, Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and Its Applications. New York: Springer-Verlag, pp. 133–155.
Bruno, D.J., Knill, E., Balding, D.J., Bruce, D.C., Doggett, N.A., Sawhill, W.W., Stalling, R.L., Whittaker, C.C., & Torney, D.C. (1995). Efficient pooling designs for library screening. Genomics 26: 21–30.Google Scholar
Erdős, P.A. & Rényi, A. (1963). On two problems of information theory, Magyar Tud. Akad. Mat. Kutató Int. Kőzl. 8: 229–243.Google Scholar
Hwang, F.K. (2000). Random k-set pool designs with distinct columns. Probability in the Engineering and Informational Sciences 14: 49–56.Google Scholar
Hwang, F.K. & Liu, Y.C. (2001). The expected number of unresolved positive clones in various random pool designs. Probability in the Engineering and Informantional Sciences 15: 57–68.Google Scholar
Hwang, F.K. & Liu, Y.C. (to appear). Random pooling designs under various structures. Journal of Combinatorial Optimization.
Macula, A.J. (1997). A simple construction of d-disjunct matrices with certain weights. Discrete Mathematics 80: 311–312.Google Scholar
Macula, A.J. (1999). Probabilistic nonadaptive group testing in the presence of errors and DNA library screening. Annals of Combinatorics 1: 61–69.Google Scholar
Percus, J.K., Percus, O.E., Bruno, W.J., & Torney, D.C. (1999). Asymptotics of pooling designs performance. Journal of Applied Probability 36: 951–964.Google Scholar