Trivial two-stage group testing for complexes using almost disjunct matrices.
From MaRDI portal
Publication:1422408
DOI10.1016/S0166-218X(03)00191-4zbMath1039.05045OpenAlexW2162273970MaRDI QIDQ1422408
Vyacheslav V. Rykov, Anthony J. Macula, Sergey Yekhanin
Publication date: 14 February 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00191-4
Design of statistical experiments (62K99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)
Related Items (15)
Almost Optimal Cover-Free Families ⋮ Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs ⋮ A group testing method for finding patterns in data ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Hypothesis group testing for disjoint pairs ⋮ Locating and detecting arrays for interaction faults ⋮ Non-adaptive learning of a hidden hypergraph ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Almost separable matrices ⋮ The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design ⋮ ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES ⋮ Non-adaptive Learning of a Hidden Hypergraph ⋮ A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters
Cites Work
This page was built for publication: Trivial two-stage group testing for complexes using almost disjunct matrices.
