標題: An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
作者: Chen, H. B.
Du, D. Z.
Hwang, F. K.
應用數學系
Department of Applied Mathematics
關鍵字: group testing;pooling designs;superimposed codes;graph testing
公開日期: 1-Oct-2007
摘要: 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.
URI: http://dx.doi.org/10.1007/s10878-007-9067-3
http://hdl.handle.net/11536/3974
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9067-3
期刊: JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume: 14
Issue: 2-3
起始頁: 121
結束頁: 129
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000248864800003.pdf