RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS

Authors:
F. K. Hwang
Affiliations:
Department of Applied Mathematics, National Chiao-Tung University, Hsinchu, Taiwan, Republic of China, E-mail: fhwang@math.nctu.edu.tw
Venue:
Probability in the Engineering and Informational Sciences
Year:
2000

Citing 0
Cited 3

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

Probability in the Engineering and Informational Sciences
A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS

Probability in the Engineering and Informational Sciences
Combinatorial pair testing: distinguishing workers from slackers

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random k-set pool designs are known to be efficient but suffer the presence of clones having identical test sets (hence indistinguishable). We propose a random pool design with distinct k-sets. We give an algorithm to generate the design and compute the expected numbers of unresolved negatives and unresolved positives. We show a relation between the two numbers which holds also for other random designs; hence, it can be used to obtain their expected numbers of unresolved positives which are not known. Among these other random designs, the random size-k design is a new design.