An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
129 | en_US |
dc.citation.issue |
2-3 | en_US |
dc.citation.spage |
121 | en_US |
dc.citation.volume |
14 | en_US |
dc.contributor.author |
Chen, H. B. | en_US |
dc.contributor.author |
Du, D. Z. | en_US |
dc.contributor.author |
Hwang, F. K. | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:05:26Z | |
dc.date.available |
2014-12-08T15:05:26Z | |
dc.date.issued |
2007-10-01 | en_US |
dc.description.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. | en_US |
dc.identifier.doi |
10.1007/s10878-007-9067-3 | en_US |
dc.identifier.issn |
1382-6905 | en_US |
dc.identifier.journal |
JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s10878-007-9067-3 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/3974 | |
dc.identifier.wosnumber |
WOS:000248864800003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
group testing | en_US |
dc.subject |
pooling designs | en_US |
dc.subject |
superimposed codes | en_US |
dc.subject |
graph testing | en_US |
dc.title |
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
- 000248864800003.pdf (271.9 KB, Adobe PDF)
所屬典藏: 會議論文
引用此條目
Chen, H. B., Du, D. Z., & Hwang, F. K. (2007). An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. JOURNAL OF COMBINATORIAL OPTIMIZATION, 14(2-3), 121–129. https://doi.org/10.1007/s10878-007-9067-3
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/3974