On Almost Disjunct Matrices for Group Testing

DOI10.1007/978-3-642-35261-4_67zbMath1260.68289arXiv1111.5003OpenAlexW3101317493MaRDI QIDQ4909581

Arya Mazumdar

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.5003

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics in computer science (68R05) Other designs, configurations (05B30) Combinatorial codes (94B25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ The design of (almost) disjunct matrices by evolutionary algorithms ⋮ Almost separable matrices ⋮ An interpretable classification method for predicting drug resistance in \(M. tuberculosis\)

This page was built for publication: On Almost Disjunct Matrices for Group Testing