Trivial two-stage group testing for complexes using almost disjunct matrices. (Q1422408): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4506360 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New constructions of superimposed codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5457045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank |
Revision as of 15:01, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trivial two-stage group testing for complexes using almost disjunct matrices. |
scientific article |
Statements
Trivial two-stage group testing for complexes using almost disjunct matrices. (English)
0 references
14 February 2004
0 references
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.)
0 references