BOUNDING THE NUMBER OF COLUMNS WHICH APPEAR ONLY IN POSITIVE POOLS

d-separable, d̅-separable and d-disjunct matrices are the major tools in constructing pooling designs which has many applications to DNA experiments, for example, the clone library screening problem. While there exists a simple decoding for d-disjunct matrices, only brute-force methods are known for...

Full description

Saved in:
Bibliographic Details
Published in:Taiwanese journal of mathematics 2006-06, Vol.10 (4), p.927-932
Main Authors: Chen, H. B., 陳宏賓, Hwang, F. K., 黃光明, Li, C. M., 李曲敏
Format: Article
Language:English
Subjects:
Mathematics
Matrices
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:d-separable, d̅-separable and d-disjunct matrices are the major tools in constructing pooling designs which has many applications to DNA experiments, for example, the clone library screening problem. While there exists a simple decoding for d-disjunct matrices, only brute-force methods are known for the other two. In this paper we identify structures in these two matrices which lead to significant improvements for decoding.
ISSN:1027-5487
2224-6851
DOI:10.11650/twjm/1500403884