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

DOI10.1007/S10878-006-9634-ZzbMATH Open1115.92019OpenAlexW1992800914MaRDI QIDQ2369987FDOQ2369987

Authors: Hong Gao, My T. Thai, Weili Wu, Taieb Znati, Frank K. Hwang 

Publication date: 21 June 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9634-z

Recommendations

• On almost disjunct matrices for group testing
• A group testing problem for hypergraphs of bounded rank
• New construction of a group testing model \((d, r, z]\)-disjunct matrix with error-tolerance
• Combinatorial group testing in bipartite graphs
• Trivial two-stage group testing for complexes using almost disjunct matrices.
• An optimal group testing algorithm on \(k\) disjoint sets
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• A tight upper bound for group testing in graphs
• Group testing in bipartite graphs

zbMATH Keywords

ComplexGroup testingPooling designsDNA library screening

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Hypergraphs (05C65) Computational methods for problems pertaining to biology (92-08)

Cites Work

• A group testing problem for hypergraphs of bounded rank
• On error-tolerant DNA screening
• Sets pooling designs
• Trivial two-stage group testing for complexes using almost disjunct matrices.
• DNA screening, pooling design and simplicial complex

Cited In (13)

• Non-adaptive complex group testing with multiple positive sets
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• Exact learning from an honest teacher that answers membership queries
• The optimal number of items in a group for group testing
• Pooling designs for clone library screening in the inhibitor complex model
• Non-adaptive complex group testing with multiple positive sets
• On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
• An adaptive algorithm for group testing for complexes
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Almost optimal cover-free families
• Strict group testing and the set basis problem
• Non-adaptive learning of a hidden hypergraph
• Non-adaptive learning of a hidden hypergraph

This page was built for publication: Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369987)