Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Disjunct_matrix> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Disjunct_matrix abstract "Disjunct and separable matrices play a pivotal role in the mathematical area of non-adaptive group testing. This area investigates efficient designs and procedures to identify 'needles in haystacks' by conducting the tests on groups of items instead of each item alone. The main concept is that if there are very few special items (needles) and the groups are constructed according to certain combinatorial guidelines, then one can test the groups and find all the needles. This can reduce the cost and the labor associated with of large scale experiments. The grouping pattern can be represented by a binary matrix, where each column represents an item and each row represents a pool. The symbol '1' denotes participation in the pool and '0' absence from a pool. The d-disjunctness and the d-separability of the matrix describe sufficient condition to identify d special items. In a matrix that is d-separable, the Boolean sum of every d columns is unique. In a matrix that is d-disjunct the Boolean sum of every d columns does not contain any other column in the matrix. Theoretically, for the same number of columns (items), one can construct d-separable matrices with fewer rows (tests) than d-disjunct. However, designs that are based on d-separable are less applicable since the decoding time to identify the special items is exponential. In contrast, the decoding time for d-disjunct matrices is polynomial.".
- Disjunct_matrix wikiPageExternalLink lect28.pdf.
- Disjunct_matrix wikiPageExternalLink lect29.pdf.
- Disjunct_matrix wikiPageID "27227184".
- Disjunct_matrix wikiPageRevisionID "574827033".
- Disjunct_matrix hasPhotoCollection Disjunct_matrix.
- Disjunct_matrix subject Category:Combinatorics.
- Disjunct_matrix comment "Disjunct and separable matrices play a pivotal role in the mathematical area of non-adaptive group testing. This area investigates efficient designs and procedures to identify 'needles in haystacks' by conducting the tests on groups of items instead of each item alone. The main concept is that if there are very few special items (needles) and the groups are constructed according to certain combinatorial guidelines, then one can test the groups and find all the needles.".
- Disjunct_matrix label "Disjunct matrix".
- Disjunct_matrix sameAs m.0bwh14q.
- Disjunct_matrix sameAs Q5282262.
- Disjunct_matrix sameAs Q5282262.
- Disjunct_matrix wasDerivedFrom Disjunct_matrix?oldid=574827033.
- Disjunct_matrix isPrimaryTopicOf Disjunct_matrix.