ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES

2009 ◽  
Vol 01 (02) ◽  
pp. 235-251 ◽  
Author(s):  
WEIWEI LANG ◽  
YUEXUAN WANG ◽  
JAMES YU ◽  
SUOGANG GAO ◽  
WEILI WU

In this paper, we define an α-almost (k; 2e + 1)-separable matrix and an α-almostke-disjunct matrix. Using their complements, we devise algorithms for fault-tolerant trivial two-stage group tests (pooling designs) for k-complexes. We derive the expected values for the given algorithms to identify all such positive complexes.

2011 ◽  
Vol 85 (1) ◽  
pp. 121-127
Author(s):  
FENGLIANG JIN ◽  
HOUCHUN ZHOU ◽  
JUAN XU

AbstractPooling designs are a very helpful tool for reducing the number of tests for DNA library screening. A disjunct matrix is usually used to represent the pooling design. In this paper, we construct a new family of disjunct matrices and prove that it has a good row to column ratio and error-tolerant property.


2004 ◽  
Vol 137 (1) ◽  
pp. 97-107 ◽  
Author(s):  
Anthony J. Macula ◽  
Vyacheslav V. Rykov ◽  
Sergey Yekhanin

2014 ◽  
Vol 25 (01) ◽  
pp. 12-28 ◽  
Author(s):  
Osval Antonio Montesinos-López ◽  
Kent Eskridge ◽  
Abelardo Montesinos-López ◽  
José Crossa

1998 ◽  
pp. 213-232 ◽  
Author(s):  
Toby Berger ◽  
James W. Mandell
Keyword(s):  

2006 ◽  
Vol 12 (3) ◽  
pp. 297-301 ◽  
Author(s):  
Hong Gao ◽  
F. K. Hwang ◽  
My T. Thai ◽  
Weili Wu ◽  
Taieb Znati

Sign in / Sign up

Export Citation Format

Share Document