|標題:||Construction of d(H)-disjunct matrix for group testing in hypergraphs|
Hwang, F. K.
Thai, My T.
Department of Applied Mathematics
|關鍵字:||group testing;pooling designs;complex;DNA library screening|
|摘要:||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.|
|期刊:||JOURNAL OF COMBINATORIAL OPTIMIZATION|
|Appears in Collections:||Articles|
Files in This Item: