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

• Type: Journal
• Year: 2007
• Where: JCO
• Authors: H. B. Chen, Ding-Zhu Du, Frank K. Hwang
• Keywords: DNA Complex, Graph Testing, JCO 2007, Surprising Equivalence Relation