Trivial two-stage group testing for complexes using almost disjunct matrices.
type: Item
instance of: scholarly article
title: Trivial two-stage group testing for complexes using almost disjunct matrices.
zbMATH Open document ID: 1039.05045
DOI: 10.1016/S0166-218X(03)00191-4
author: Anthony J. Macula
author: Vyacheslav V. Rykov
author: Sergey Yekhanin
published in: Discrete Applied Mathematics
publication date: 2004-02-14T00:00:00Z
review text: Given \(t\) items with \(k\) unknown positive ones, the group testing problem is asking to identify all \(k\) positive items with a less number of tests each of which is on a subset of items and tells whether the subset contains a positive item or not. Consider a hypergraph with all \(k\)-subsets as its hyperedges and \(t\) items as its vertices. All \(k\) positive items form a positive hyperedge. Each test would tell whether the tested subset is incident to the positive hyperedge or not. The problem studied in this paper is a generalization of dual group testing problem. First, each test outcome is whether a subset contains a positive hyperedge or not, which is a dual test model in group testing. Secondly, there is not only one positive hyperedge. In this paper, the authors present a two-stage algorithm for identifying all positive hyperedges. (The hyperedge is called complex in this paper.)
reviewed by: Du Ding-Zhu
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 62K99
Mathematics Subject Classification ID: 05B20
zbMATH DE Number: 2041890
MaRDI profile type: Publication
cites work: Q4506360
cites work: New constructions of superimposed codes
cites work: Q5457045
cites work: Q4146667
full work available at URL: s0166-218x(03)00191-4
OpenAlex ID: W2162273970
description: scientific article; zbMATH DE number 2041890