Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barillot E, Lacroix B, Cohen D (1991) Theoretical analysis of library screening using a N-dimensional pooling designs. Nucleic Acids Res 19:6241–6247

    Google Scholar 

  • Dorfman R (1943) The detection of defective members of large populations. Ann Math Statist 14:436–440

    Google Scholar 

  • Du D-Z, Hwang FK (1999) Combinatorial group testing and its applications (2nd ed.). World Scientific, Singapore

    MATH  Google Scholar 

  • Du D-Z, Hwang FK (2006) Pooling designs: Group testing in molecular biology. World Scientific, Singapore

    Google Scholar 

  • Du D-Z, Hwang FK, Wu W, Znati T (2004) A new construction of transversal designs, manuscript

  • D’ychkov AG, Macula AJ, Torney DC, Vilenkin PA (2001) Two models of nonadaptive group testing for designing screening experiments. In: Proc. 6th Int. Workshop on Model-Orented Designs and Analysis, pp. 63–75

  • Farach M, Kannan S, Knill E, Muthukrishnan S (1997) Group testing problem with sequences in experimental molecular biology. In: Proc. Compression and Complexity of Sequences, pp 357–367

  • Ngo HQ, Du D-Z (2000) A survey on combinatorial group testing algorithms with applications to DNA library screening. In: Discrete mathematical problems with medical applications (New Brunswick, NJ, 1999), pp. 171–182, DIMACS Ser. Discrete Math Theoret Comput Sci, 55, Amer Math Soc, Providence, RI

  • Macula AJ, Torney DC, Villenkin PA (2000) Two-stage group testing for complexes in the presence of errors. DIMACS Sries Disc Math Theor Comput Sci 55:145–157

    Google Scholar 

  • Macula AJ, Rykov VV, Yekhanin S (2004) Trivial two-stage group testing for complexes using almost disjunct matrices. Disc Appl Math 137:97–107

    Article  MATH  MathSciNet  Google Scholar 

  • Marathe MV, Percus AG, Torney DC (2000) Combinatorial optimization in biology, manuscript

  • Park H, Wu W, Wu X, Zhao HG (2003) DNA screening, nonadaptive group testing, and simplicial complex, J Comb Optim 7:389–394

    Article  MATH  MathSciNet  Google Scholar 

  • Thierry-Mieg N, Trilling L, Roch J-L (2004) Anovel pooling design for protein-protein interaction mapping. manuscript

  • Torney DC (1999) Sets pooling designs. Ann Comb 3:95–101

    Article  MATH  MathSciNet  Google Scholar 

  • Triesch E (1996) A group testing problem for hypergraphs of bounded rank. Disc Appl Math 66:185–188

    Article  MATH  MathSciNet  Google Scholar 

  • Wu W, Li C, Huang X, Li Y (2004) On error-tolerant DNA screening. Discrete Applied Mathematics

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science Harbin Institute of Technology, Harbin, 150001, P. R. China

    Hong Gao

  2. Department of Applied Mathematics, National Chiaotung University, Hsing Chu, Taiwan, ROC

    F. K. Hwang

  3. Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, 32611, USA

    My T. Thai

  4. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA

    Weili Wu

  5. Department of Computer Science, University of Pittsbugh, Pittsburgh, PA, 15215, USA

    Taieb Znati

Authors
  1. Hong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. K. Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. My T. Thai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Taieb Znati
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weili Wu.

Additional information

Weili Wu: Support in part by National Science Foundation under grant ACI-0305567.

Taieb Znati: Support in part by National Science Foundation under grant CCF-0548895.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, H., Hwang, F.K., Thai, M.T. et al. Construction of d(H)-disjunct matrix for group testing in hypergraphs. J Comb Optim 12, 297–301 (2006). https://doi.org/10.1007/s10878-006-9634-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-9634-z

Keywords

Search

Navigation