Browsing by Author "Chen, H. B."

Now showing 1 - 2 of 2

An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
(2007-10-01)
Chen, H. B.
;
Du, D. Z.
;
Hwang, F. K.
;
應用數學系
;
Department of Applied Mathematics
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relation among these four problems, and use this equivalence to improve current results on graph testing. In the rest of this paper, we give a lower bound for the minimum number of tests on DNA complex screening model.
Bounding the number of columns which appear only in positive pools
(2006-06-01)
Chen, H. B.
;
Hwang, F. K.
;
Li, C. M.
;
應用數學系
;
Department of Applied Mathematics
d-separable, (d) over bar -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.