Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (Q2369987): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Trivial two-stage group testing for complexes using almost disjunct matrices. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: DNA screening, pooling design and simplicial complex / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sets pooling designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A group testing problem for hypergraphs of bounded rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On error-tolerant DNA screening / rank | |||
Normal rank |
Latest revision as of 10:23, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs |
scientific article |
Statements
Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (English)
0 references
21 June 2007
0 references
Group testing
0 references
Pooling designs
0 references
Complex
0 references
DNA library screening
0 references