Sciweavers

JCO
2007

An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure

13 years 3 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
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. Keywords Group testing · Pooling designs · Superimposed codes · Graph testing
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JCO
Authors H. B. Chen, Ding-Zhu Du, Frank K. Hwang
Comments (0)