Data Set Used
Phylogenetic analysis of supraspecies relationships in one of the most young and species rich group of myomorph rodents - subfamily Arvicolinae was carried out on the base of two nuclear genes. Results have shown that mole-voles - Ellobiusini, steppe voles - (Lagurini) and grey voles (Arvicolini) are sister groups. This divergence is the most late, third… (More)
It is rather difficult to construct a system of gray voles of the tribe Microtini by a set of morphological and karyological characters because form generation is mosaic at these organization levels. The sequence of the mitochondrial cytochrome b gene was used to study the phylogenetic relationships and taxonomic position of the Central Asian subgenus… (More)
A (w, r) cover-free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A binary (w, r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as a concept of key distribution patterns. In this paper, we develop a method of… (More)
We consider two generalizations of group testing: threshold group testing (introduced by Damaschke ) and majority group testing (a further generalization , including threshold group testing and a model introduced by Lebedev ). We show that each separating code gives a nonadaptive strategy for threshold group testing for some parameters. This is a… (More)
The two models described in this paper having as ingredients feedback resp. localized errors give possibilities for code constructions not available in the standard model of error correction and also for probabilistic channel models. For the feedback model we present here a coding scheme, which we call the rubber method, because it is based on erasing… (More)
We consider two generalizations of group testing: threshold group testing (introduced by Damaschke ) and majority group testing (a further generalization, including threshold group testing and a model introduced by Lebedev ).
—We introduce a minimal shadow problem for a word-subword relation. We obtain upper and lower bounds for the minimal shadow cardinality.
We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained… (More)