Identifying d positive clones in the presence of inhibitors
by Ding-Zhu Du, Frank K. Hwang
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 1, No. 2, 2005

Abstract: 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.

Online publication date: Sat, 06-Aug-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com