|
|
|
|
|
Boris Melnikov,Anastasia Nichiporchuk,Marina Trenina,Mikhail Abramyan
Pág. 1 - 8
In discrete optimization problems, we apply algorithms based on extensions of the branch and bound method. These extensions consist in the joint work of several auxiliary heuristic algorithms, they can be referred to different, independent from each othe...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Marina Trenina
Pág. 1 - 13
In this paper, we continue to consider one of the tasks of biocybernetics, i.e. the problem of reconstructing the distance matrix between DNA sequences. In this problem, not all the elements of the matrix under consideration are known ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Marina Trenina
Pág. 1 - 13
In practice, quite often there is a need to calculate in a special way certain distances between sequences of different nature. Similar algorithms are used in bioinformatics to compare sequenced genetic chains. Due to the large dimension of such chains, ...
ver más
|
|
|
|
|
|