Zobrazeno 1 - 10
of 21
pro vyhledávání: '"K. Yu. Gorbunov"'
Autor:
Vassily A. Lyubetsky, K. Yu. Gorbunov
Publikováno v:
Doklady Mathematics. 102:376-379
For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of
Autor:
K. Yu. Gorbunov
Publikováno v:
http://eng.biomos.ru/conference/articles.htm. 1:207-209
For any weighted directed chain-cycle graphs a and b (referred to as structures) and any equal costs of operations (intermergings and duplication), we obtain an algorithm which, by successively applying these operations to a, outputs b if the first s
Autor:
K. Yu. Gorbunov, V. A. Lyubetsky
Publikováno v:
Automation and Remote Control. 79:2203-2216
Autor:
K. Yu. Gorbunov, Vassily A. Lyubetsky
Publikováno v:
Journal of Communications Technology and Electronics. 62:653-662
A novel time- and memory-efficient algorithm for solving the problem of finding the most economical (i.e., having the lowest overall cost) transformation of an arbitrary oriented graph representing a disjoint union of chains and cycles into another g
Autor:
Vassily A. Lyubetsky, K. Yu. Gorbunov
Publikováno v:
Doklady Mathematics. 96:503-505
A complete proof that algorithms proposed by the authors solve the problem of minimum-cost transformation of a graph into another graph is given. The problem is solved both by a direct algorithm of linear complexity and by a reduction to quadratic in
Publikováno v:
Molecular Biology. 49:327-338
The chromosome structure is defined as a set of chromosomes that consist of genes assigned to one of the DNA strands and represented in a circular or linear arrangement. A widely investigated problem is to define the shortest algorithmic path of chro
Publikováno v:
Problems of Information Transmission. 48:185-192
In a space of dimension 30 we find a pair of parallel hyperplanes, uniquely determined by vertices of a unit cube lying on them, such that strictly between the hyperplanes there are no vertices of the cube, though there are integer points. A similar
Autor:
Vassily A. Lyubetsky, K. Yu. Gorbunov
Publikováno v:
Problems of Information Transmission. 47:274-288
We formulate the problem of constructing a tree which is the nearest on average to a given set of trees. The notion of "nearest" is formulated based on a conception of events such that counting their number makes it possible to distinguish each of th
Autor:
K. Yu. Gorbunov, Vassily A. Lyubetsky
Publikováno v:
Molecular Biology. 43:881-893
A model and algorithm are proposed to infer the evolution of a gene family described by the corresponding gene tree, with respect to the species evolution described by the corresponding species tree. The model describes the evolution using the new co
Publikováno v:
Molecular Biology. 43:485-499
An algorithm for modeling the evolution of the regulatory signals involving the interaction with RNA secondary structure is proposed. The algorithm implies that the species phylogenetic tree is known and is based on the assumption that the considered