Abstractd-Disjunct matrices, d¯-separable matrices and d-separable matrices are well studied in various problems including group testing, coding, extremal set theory and, recently, DNA sequencing. The implications from the first two matrices to the last one are well documented. This paper gives an implication of the other direction for the first time
AbstractLet [t] represent a finite population with t elements. Suppose we have an unknown d-family o...
AbstractLet [n] denote {1, 2, …, n}. A set system σ on [n] is called a separating system on [n] if f...
This thesis discusses matrix properties as they relate to the idea of non-adaptive group testing. Th...
d-disjunct matrices, d-separable matrices and d-separable matrices are well studied in various probl...
An m×n matrix A with column supports {Si} is k-separable if the disjunctions ⋃i∈KSi are ...
Abstractd-disjunct matrices constitute a basis for nonadaptive group testing (NGT) algorithms and bi...
An m × n matrix A with column supports {Si} is k-separable if the disjunctions i∈K Si are all distin...
AbstractA t-packing is an ordered pair (V,P) where V is a v-set and P is a collection of k-subsets (...
AbstractWe give a simple method of constructing d-disjunct matrices. For k > d, our construction yie...
AbstractMacula proposed a novel construction of pooling designs which can effectively identify posit...
AbstractA binary matrix is said to be d-disjunct if the union (or Boolean sum) of any d columns does...
Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. A ...
AbstractWe show that Macula's claim of a Hamming distance 4 between any two candidate sets of positi...
The absolute separability problem asks for a characterization of the quantum states ρ∈Mm⊗Mn with the...
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive...
AbstractLet [t] represent a finite population with t elements. Suppose we have an unknown d-family o...
AbstractLet [n] denote {1, 2, …, n}. A set system σ on [n] is called a separating system on [n] if f...
This thesis discusses matrix properties as they relate to the idea of non-adaptive group testing. Th...
d-disjunct matrices, d-separable matrices and d-separable matrices are well studied in various probl...
An m×n matrix A with column supports {Si} is k-separable if the disjunctions ⋃i∈KSi are ...
Abstractd-disjunct matrices constitute a basis for nonadaptive group testing (NGT) algorithms and bi...
An m × n matrix A with column supports {Si} is k-separable if the disjunctions i∈K Si are all distin...
AbstractA t-packing is an ordered pair (V,P) where V is a v-set and P is a collection of k-subsets (...
AbstractWe give a simple method of constructing d-disjunct matrices. For k > d, our construction yie...
AbstractMacula proposed a novel construction of pooling designs which can effectively identify posit...
AbstractA binary matrix is said to be d-disjunct if the union (or Boolean sum) of any d columns does...
Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. A ...
AbstractWe show that Macula's claim of a Hamming distance 4 between any two candidate sets of positi...
The absolute separability problem asks for a characterization of the quantum states ρ∈Mm⊗Mn with the...
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive...
AbstractLet [t] represent a finite population with t elements. Suppose we have an unknown d-family o...
AbstractLet [n] denote {1, 2, …, n}. A set system σ on [n] is called a separating system on [n] if f...
This thesis discusses matrix properties as they relate to the idea of non-adaptive group testing. Th...
DOI
Add to ORKG