Name
Title | ||
|---|---|---|
Efficient constructions of disjunct matrices with applications to DNA library screening. |
Abstract | ||
|---|---|---|
The study of gene functions requires a DNA library of high quality, such a library is obtained from a large mount of testing and screening. Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. In this paper, we present two Las Vegas algorithms for efficient constructions of d-disjunct and (d;z)-disjunct matrices respectively. These new constructions can be directly applied to construct error-free and error-tolerant pooling designs. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1089/cmb.2007.0052 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
disjunct matrices,DNA library screening,Las Vegas algorithm,nonadaptive group testing,pooling designs | Library,Matrix (mathematics),Pooling,Artificial intelligence,Bioinformatics,Disjunct,Las Vegas algorithm,Machine learning,Mathematics | Journal |
Volume | Issue | ISSN |
14.0 | 9 | 1066-5277 |
Citations | PageRank | References |
12 | 0.75 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongxi Cheng | 1 | 125 | 15.23 |
| Ding-Zhu Du | 2 | 3497 | 283.06 |