doi:10.1016/j.dam.2006.02.006
Copyright © 2006 Elsevier B.V. All rights reserved.
On error-tolerant DNA screening
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Weili Wua,
,
, Yaochun Huanga, Xiao Huangb,
and Yingshu Lic, 
aDepartment of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA
b3M Center, Building 0235-03-F-08, St. Paul, MN 55144, USA
cDepartment of Computer Science, Georgia State University, Atlanta, GA 30303, USA
Received 4 December 2003;
revised 25 January 2006;
accepted 3 February 2006.
Available online 25 April 2006.
Abstract
Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outcome is either the pool contains a positive clone or not. In this paper, we show that for a class of designs, if we apply those for samples with d positive clones to samples with at most d-1 positive clones, the error-tolerant property will have an interesting improvement. We also make a remark on decoding method for k-error-correcting d-disjunct matrix.
Keywords: DNA screening; Error tolerant; Pooling design; Group testing
Fig. 1. Construction of G′ from G.
Support in part by National Science Foundation under grant ACI-0305567.

Corresponding author.