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

Abstract 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.

[1]  Noga Alon,et al.  An optimal procedure for gap closing in whole genome shotgun sequencing , 2001, RECOMB.

[2]  David C. Torney,et al.  Sets pooling designs , 1999 .

[3]  Vladimir Grebinski,et al.  Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping , 1998, Discret. Appl. Math..

[4]  Douglas R. Stinson,et al.  Generalized cover-free families , 2004, Discret. Math..

[5]  Arkadii G. D'yachkov,et al.  Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others , 2002, J. Comb. Theory A.

[6]  Wei-Mou Zheng,et al.  Protein secondary structure prediction by combining hidden Markov models and sliding window scores , 2003, Int. J. Bioinform. Res. Appl..

[7]  Sergey Yekhanin,et al.  Trivial two-stage group testing for complexes using almost disjunct matrices , 2004, Discret. Appl. Math..

[8]  Anthony J. Macula,et al.  A group testing method for finding patterns in data , 2004, Discret. Appl. Math..

[9]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[10]  Béla Bollobás,et al.  On separating systems , 2007, Eur. J. Comb..

[11]  Vladimir Grebinski,et al.  Optimal Reconstruction of Graphs under the Additive Model , 1997, Algorithmica.

[12]  Lie Zhu,et al.  Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.

[13]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[14]  David C. Torney,et al.  Two-stage group testing for complexes in the presence of errors , 1999, Discrete Mathematical Problems with Medical Applications.

[15]  Weili Wu,et al.  Construction of d(H)-disjunct matrix for group testing in hypergraphs , 2006, J. Comb. Optim..

[16]  Noga Alon,et al.  Learning a hidden matching , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Vladimir S. Lebedev,et al.  On optimal superimposed codes , 2004 .

[18]  Konrad Engel,et al.  Interval Packing and Covering in the Boolean Lattice , 1996, Combinatorics, Probability and Computing.

[19]  Chris J. Mitchell,et al.  Key storage in secure networks , 1988, Discret. Appl. Math..

[20]  Weili Wu,et al.  Protein-protein interaction and group testing in bipartite graphs , 2005, Int. J. Bioinform. Res. Appl..