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

Hong Gao (), F. K. Hwang, My T. Thai (), Weili Wu () and Taieb Znati ()
Additional contact information
Hong Gao: Department of Computer Science Harbin Institute of Technology
F. K. Hwang: National Chiaotung University
My T. Thai: University of Florida
Weili Wu: University of Texas at Dallas
Taieb Znati: University of Pittsbugh

Journal of Combinatorial Optimization, 2006, vol. 12, issue 3, No 7, 297-301

Abstract: 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.

Keywords: Group testing; Pooling designs; Complex; DNA library screening (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-9634-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:12:y:2006:i:3:d:10.1007_s10878-006-9634-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-9634-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().