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

Journal of Combinatorial Optimization

Volumn 14, Issue 2-3, 2007, Pages 121-129

  Chen, H B ^a   Du, D Z ^b   Hwang, F K ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b The University of Texas at Dallas   (United States)

Author keywords

Graph testing; Group testing; Pooling designs; Superimposed codes

Indexed keywords

CODES (SYMBOLS); GENETIC ALGORITHMS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

GRAPH TESTING; GROUP TESTING; POOLING DESIGNS; SUPERIMPOSED CODES;

GRAPH THEORY;

EID: 34548102709     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9067-3     Document Type: Conference Paper

References (20)

1. Alon N, Beigel R, Kasif S, Rudich S, Sudakov B (2004) Learning a hidden matching. SIAM J Comput 33:487-501
2. Balding DZ, Bruno WJ, Knill E, Torney DC (1996) A comparatively survey of nonadaptive pooling designs, genetic mapping and DNA sequencing, IMA volumes in mathematics and its applications. Springer, New York, pp 133-154
3. Beigel R, Alon N, Apaydin MS, Fortnow L, Kasif S (2001) An optimal procedure for gap closing in whole genome shotgun sequencing. In: Proc. 2001 RECOMB. ACM Press, pp 22-30
4. Du DZ, Hwang FK (2000) Combinatorial group testing and its applications, 2nd edn. World Scientific, Singapore
5. D'yachkov A, Vilenkin PA, Macula AJ, Torney DC (2002) Families of finite sets in which no intersection of ℓ sets is covered by the union of s others. J Comb Theory Ser A 99:195-218
6. Engel K (1996) Interval packing and covering in the boolean lattice. Comb Probab Comput 5:373-384
7. Gao H, Hwang FK, Thai MT, Wu W, Znati T (2006) Construction of d(H)-disjunct matrix for group testing in hypergraphs. J Comb Optim 12:297-301
8. Grebinski V, Kucherov G (1998) Reconstructing a Hamiltonian cycle by querying the graph: application to DNA physical mapping. Discret Appl Math 88:147-165
9. Grebinski V, Kucherov G (2000) Optimal reconstruction of graphs under the additive model. Algorithmica 28:104-124
10. Kautz WH, Singleton RR (1964) Nonrandom binary superimposed codes. IEEE Trans Inform Theory 10:363-377
11. Kim HK, Lebedev V (2004) On optimal superimposed codes. J Comb Des 12:79-91
12. Li Y, Thai MT, Liu Z, Wu W (2005) Protein-protein interaction and group testing in bipartite graphs. Int J Bioinf Res Appl 1:420-428
13. Macula AJ, Popyack LJ (2004) A group testing method for finding patterns in data. Discret Appl Math 144:149-157
14. Macula AJ, Torney DC, Vilenkin PA (1999) Two-stage group testing for complexes in the presence of errors. DIMACS Ser Discret Math Theor Comput Sci 55:145-157
15. Macula AJ, Rykov VV, Yekhanin S (2004) Trivial two-stage group testing for complexes using almost disjunct matrices. Discret Appl Math 137:97-107
16. Mitchell CJ, Piper FC (1988) Key storage in secure networks. Discret Appl Math 21:215-228
17. Sagalovich YuL (1994) On separating systems. Probl Peredachi Inform 30:14-35 (in Russian)
18. Stinson DR, Wei R (2004) Generalized cover-free families. Discret Math 279:463-477
19. Stinson DR, Wei R, Zhu L (2000) Some new bounds for cover-free families. J Comb Theory Ser A 90:224-234
20. Torney DC (1999) Sets pooling designs. Ann Comb 3:95-101