AbstractWe show that Macula's claim of a Hamming distance 4 between any two candidate sets of positive clones in his pool design is incorrect. However, a previous proof of his on a weaker result (with a condition on design parameters) is correct. We also show that the condition is sharp and the distance 4 result is also sharp for arbitrary parameter values
Hamming distance between the cellular automata image for some different mammalian species and Human,...
AbstractGiven n clones with some positive ones, the problem of DNA screening is to identify all posi...
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop system is alway...
AbstractWe show that Macula's claim of a Hamming distance 4 between any two candidate sets of positi...
AbstractPooling designs are standard experimental tools in many biotechnical applications. It is wel...
AbstractIt is well known that many famous pooling designs are constructed from mathematical structur...
AbstractMotivated by the pooling designs over the incidence matrices of matchings with various sizes...
Ahlswede R. On code pairs with specified Hamming distances. In: Combinatorics. Colloquia mathematic...
AbstractWe propose two new classes of non-adaptive pooling designs. The first one is guaranteed to b...
AbstractIn using pooling designs to identify clones containing a specific subsequence called positiv...
Abstract. Spearman distance is a permutation distance which might prove useful for coding, e.g. for ...
AbstractMacula proposed a novel construction of pooling designs which can effectively identify posit...
DNA microarrays constitute an in vitro example system of a highly crowded molecular recognition envi...
Abstract. An alternative notion of approximation arising in cognitive psychology, bioinformatics and...
We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be d-err...
Hamming distance between the cellular automata image for some different mammalian species and Human,...
AbstractGiven n clones with some positive ones, the problem of DNA screening is to identify all posi...
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop system is alway...
AbstractWe show that Macula's claim of a Hamming distance 4 between any two candidate sets of positi...
AbstractPooling designs are standard experimental tools in many biotechnical applications. It is wel...
AbstractIt is well known that many famous pooling designs are constructed from mathematical structur...
AbstractMotivated by the pooling designs over the incidence matrices of matchings with various sizes...
Ahlswede R. On code pairs with specified Hamming distances. In: Combinatorics. Colloquia mathematic...
AbstractWe propose two new classes of non-adaptive pooling designs. The first one is guaranteed to b...
AbstractIn using pooling designs to identify clones containing a specific subsequence called positiv...
Abstract. Spearman distance is a permutation distance which might prove useful for coding, e.g. for ...
AbstractMacula proposed a novel construction of pooling designs which can effectively identify posit...
DNA microarrays constitute an in vitro example system of a highly crowded molecular recognition envi...
Abstract. An alternative notion of approximation arising in cognitive psychology, bioinformatics and...
We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be d-err...
Hamming distance between the cellular automata image for some different mammalian species and Human,...
AbstractGiven n clones with some positive ones, the problem of DNA screening is to identify all posi...
In 1986, Du and Hwang proved that the probability of failure in a cyclic double-loop system is alway...
DOI
Add to ORKG