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

Authors:
F. K. Hwang;Y. C. Liu
Affiliations:
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;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
Venue:
Probability in the Engineering and Informational Sciences
Year:
2004

Citing 3
Cited 0

A simple construction of d-disjunct matrices with certain constant weights

Discrete Mathematics
THE EXPECTED NUMBERS OF UNRESOLVED POSITIVE CLONES FOR VARIOUS RANDOM POOL DESIGNS

Probability in the Engineering and Informational Sciences
RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	0.00

Visualization

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.