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.
authors.affiliation: Department of Computer Science, Tsinghua University, Beijing, China. cyx@mails.tsinghua.edu.cn
authors.forename: Yongxi
authors.initials: Y
authors.lastname: Cheng
authors.forename: Ding-Zhu
authors.initials: DZ
authors.lastname: Du
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D015723:Gene Library