Construction of d(H)-disjunct matrix for group testing in hypergraphs

檔案

日期

2006-11-01

期刊名稱

JOURNAL OF COMBINATORIAL OPTIMIZATION

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料