Trivial two-stage group testing for complexes using almost disjunct matrices.

DOI10.1016/S0166-218X(03)00191-4MaRDI QIDQ1422408zbMATH OpenOpenAlexFDO

Authors Anthony J. Macula, Vyacheslav V. Rykov, 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

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 5262866
• ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES
• An adaptive algorithm for group testing for complexes
• Trivial two-stage group testing with high error rates
• Non-adaptive complex group testing with multiple positive sets

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 5262866 (Why is no real title available?)
• New constructions of superimposed codes

Cited in

(19)

• An upper bound of the number of tests in pooling designs for the error-tolerant complex model
• A group testing method for finding patterns in data
• ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES
• Non-adaptive complex group testing with multiple positive sets
• The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• 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
• Hypothesis group testing for disjoint pairs
• Locating and detecting arrays for interaction faults
• A construction of d^z-disjunct matrices in a dual space of symplectic space
• Non-adaptive complex group testing with multiple positive sets
• A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters
• scientific article; zbMATH DE number 5262866 (Why is no real title available?)
• An adaptive algorithm for group testing for complexes
• Almost separable matrices
• Almost optimal cover-free families
• Non-adaptive learning of a hidden hypergraph
• Non-adaptive learning of a hidden hypergraph

This page was built for publication: Trivial two-stage group testing for complexes using almost disjunct matrices.

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