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

Hong Gao, F. K. Hwang, My T. Thai, Weili Wu, Taieb Znati

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)297-301
Number of pages5
JournalJournal of Combinatorial Optimization
Issue number3
Publication statusPublished - Nov 2006
Externally publishedYes


  • Complex
  • DNA library screening
  • Group testing
  • Pooling designs

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Construction of d(H)-disjunct matrix for group testing in hypergraphs'. Together they form a unique fingerprint.

Cite this