IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v12y2006i3d10.1007_s10878-006-9634-z.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Hong Gao & F. K. Hwang & My T. Thai & Weili Wu & Taieb Znati, 2006. "Construction of d(H)-disjunct matrix for group testing in hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 12(3), pages 297-301, November.
    • Handle: RePEc:spr:jcomop:v:12:y:2006:i:3:d:10.1007_s10878-006-9634-z
    DOI: 10.1007/s10878-006-9634-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-9634-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-9634-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. My T. Thai & Taieb Znati, 2009. "On the complexity and approximation of non-unique probe selection using d-disjunct matrix," Journal of Combinatorial Optimization, Springer, vol. 17(1), pages 45-53, January.
    2. H. B. Chen & D. Z. Du & F. K. Hwang, 2007. "An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution," Journal of Combinatorial Optimization, Springer, vol. 14(2), pages 121-129, October.
    3. Fei-huang Chang & Huilan Chang & Frank K. Hwang, 2011. "Pooling designs for clone library screening in the inhibitor complex model," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 145-152, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:12:y:2006:i:3:d:10.1007_s10878-006-9634-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.