Construction of d(H)-disjunct matrix for group testing in hypergraphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
301 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
297 | en_US |
dc.citation.volume |
12 | en_US |
dc.citation.woscount |
12 | |
dc.contributor.author |
Gao, Hong | en_US |
dc.contributor.author |
Hwang, F. K. | en_US |
dc.contributor.author |
Thai, My T. | en_US |
dc.contributor.author |
Wu, Weili | en_US |
dc.contributor.author |
Znati, Taieb | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:15:32Z | |
dc.date.available |
2014-12-08T15:15:32Z | |
dc.date.issued |
2006-11-01 | en_US |
dc.description.abstract |
Given a hypergraph with at most d positive edges, identify all positive edges with the minimum number of tests each of which tests on a subset of nodes, called a pool, and the outcome is positive if and only if the pool contains a positive edge. This problem is called the group testing in hypergraphs, which has been found to have many applications in molecular biology, such as the interactions between bait proteins and prey proteins, the complexes of eukaryotic DNA transcription and RNA translation. In this paper, we present a general construction for constructions of nonadaptive algorithms for group testing in hypergraphs. | en_US |
dc.identifier.doi |
10.1007/s10878-006-9634-z | 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-006-9634-z | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/11622 | |
dc.identifier.wosnumber |
WOS:000240317300007 | |
dc.language.iso |
en_US | en_US |
dc.subject |
group testing | en_US |
dc.subject |
pooling designs | en_US |
dc.subject |
complex | en_US |
dc.subject |
DNA library screening | en_US |
dc.title |
Construction of d(H)-disjunct matrix for group testing in hypergraphs | en_US |
dc.type |
Article | en_US |
檔案
- 000240317300007.pdf (189.2 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Gao, H., Hwang, F. K., Thai, M. T., Wu, W., & Znati, T. (2006). Construction of d(H)-disjunct matrix for group testing in hypergraphs. JOURNAL OF COMBINATORIAL OPTIMIZATION, 12(3), 297–301. https://doi.org/10.1007/s10878-006-9634-z
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11622