On error-tolerant DNA screening

Authors:
Weili Wu;Yaochun Huang;Xiao Huang;Yingshu Li
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;3M Center, St. Paul, MN;Department of Computer Science, Georgia State University, Atlanta, GA
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 3
Cited 2

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

Discrete Mathematics
Error-correcting nonadaptive group testing with de-disjunct matrices

Discrete Applied Mathematics
On Macula's error-correcting pool designs

Discrete Mathematics

Protein-protein interaction and group testing in bipartite graphs

International Journal of Bioinformatics Research and Applications
A construction of dz-disjunct matrices in a dual space of symplectic space

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

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.