Farach et al. introduced the inhibitor model in pooling design, where existence of a single inhibitor clone in a pool dictates its outcome to be negative regardless of the existence of positive clones in the pool. Various sequential or multiround pooling designs have been given to identify all the positive clones under the inhibitor model. Recently, Hwang and Liu gave a (one round) pooling design for the inhibitor model which is error tolerant. More specifically, suppose the set of n clones to be screened contains up to d positive clones, up to r inhibitors and the pooling experiments can generate up to e errors, they show that a (d + r + 2e)-disjunct matrix does the job. In this paper, we give a pooling design for the case that among n clones exactly d are positive. We reduce the requirement of (d + r + 2e)-disjunctness to (d + r + e)-disjunctness, which would mean the saving of many pools. We also show how our design can be used to identify all positive clones when their number is, at most, d.
[1]
Frank K. Hwang,et al.
Error-Tolerant Pooling Designs with Inhibitors
,
2003,
J. Comput. Biol..
[2]
Sampath Kannan,et al.
Group testing problems with sequences in experimental molecular biology
,
1997,
Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[3]
Anthony J. Macula,et al.
Error-correcting Nonadaptive Group Testing with de-disjunct Matrices
,
1997,
Discret. Appl. Math..
[4]
Annalisa De Bonis,et al.
Improved Algorithms for Group Testing with Inhibitors
,
1998,
Inf. Process. Lett..
[5]
Frank K. Hwang,et al.
Exploring the missing link among d-separable, d_-separable and d-disjunct matrices
,
2007,
Discret. Appl. Math..
[6]
Ding-Zhu Du,et al.
Hypergeometric and Generalized Hypergeometric Group Testing
,
1981
.