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

DOI10.1007/s10878-006-9634-zzbMath1115.92019OpenAlexW1992800914MaRDI QIDQ2369987

Hong Gao, Weili Wu, My T. Thai, 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

zbMATH Keywords

ComplexGroup testingPooling designsDNA library screening

Mathematics Subject Classification ID

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

Related Items (14)

Almost Optimal Cover-Free Families ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Strict group testing and the set basis problem ⋮ The optimal number of items in a group for group testing ⋮ An adaptive algorithm for group testing for complexes ⋮ 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 ⋮ On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix ⋮ Pooling designs for clone library screening in the inhibitor complex model ⋮ Non-adaptive Learning of a Hidden Hypergraph

Cites Work

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

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