Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications

2011 ◽  
pp. 557-568 ◽  
Author(s):  
Hung Q. Ngo ◽  
Ely Porat ◽  
Atri Rudra
Keyword(s):  
Disjunct Matrices

scholarly journals A NEW CONSTRUCTION FOR POOLING DESIGNS

2011 ◽  
Vol 85 (1) ◽  
pp. 121-127
Author(s):  
FENGLIANG JIN ◽  
HOUCHUN ZHOU ◽  
JUAN XU
Keyword(s):  
Library Screening ◽  
Pooling Design ◽  
Pooling Designs ◽  
Disjunct Matrix ◽  
Helpful Tool ◽  
Dna Library ◽  
New Family ◽  
New Construction ◽  
Dna Library Screening ◽  
Disjunct Matrices

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.

The Design of (Almost) Disjunct Matrices by Evolutionary Algorithms

2018 ◽  
pp. 152-163
Author(s):  
Karlo Knezevic ◽  
Stjepan Picek ◽  
Luca Mariot ◽  
Domagoj Jakobovic ◽  
Alberto Leporati
Keyword(s):  
Evolutionary Algorithms ◽  
Disjunct Matrices

scholarly journals A construction of dz-disjunct matrices by orthogonal space and discussion on their design parameters

2009 ◽  
Vol 309 (20) ◽  
pp. 6026-6034 ◽  
Author(s):  
Geng-sheng Zhang ◽  
Yu-qin Yang ◽  
Xiang-hui Zhao
Keyword(s):  
Design Parameters ◽  
Orthogonal Space ◽  
Disjunct Matrices

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
Keyword(s):  
Fault Tolerant ◽  
Group Testing ◽  
Pooling Designs ◽  
Two Stage ◽  
Disjunct Matrix ◽  
Expected Values ◽  
Disjunct Matrices ◽  
Separable Matrix ◽  
The Given

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.

Sign in / Sign up

Export Citation Format

Share Document