標題: Construction of d(H)-disjunct matrix for group testing in hypergraphs
作者: Gao, Hong
Hwang, F. K.
Thai, My T.
Wu, Weili
Znati, Taieb
應用數學系
Department of Applied Mathematics
關鍵字: group testing;pooling designs;complex;DNA library screening
公開日期: 1-Nov-2006
摘要: 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.
URI: http://dx.doi.org/10.1007/s10878-006-9634-z
http://hdl.handle.net/11536/11622
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9634-z
期刊: JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume: 12
Issue: 3
起始頁: 297
結束頁: 301
Appears in Collections:Articles


Files in This Item:

  1. 000240317300007.pdf