IMPLEMENTATION OF THE BRANCH AND BOUND METHOD FOR THE PROBLEM OF RECOVERING A DISTANCES MATRIX BETWEEN DNA STRINGS
Bioinformatics has two important problems for the study of evolutionary processes: calculating the distance between DNA sequences and restoring a matrix of distances sequences of different genomes when not all initial elements are known. Due to the large dimension of DNA chains, heuristic algorithms...
Main Authors: | Mikhail E. Abramyan, Boris F. Melnikov, Marina A. Trenina |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2019-04-01
|
Series: | Современные информационные технологии и IT-образование |
Subjects: | |
Online Access: | http://sitito.cs.msu.ru/index.php/SITITO/article/view/475 |
Similar Items
-
Some bounds on the distance-sum-connectivity matrix
by: Gülistan Kaya Gök
Published: (2018-07-01) -
Improved McClelland and Koolen–Moulton bounds for distance energy of a graph
by: G. Sridhara, et al.
Published: (2018-12-01) -
Bounding the Norm of Matrix Powers
by: Dowler, Daniel Ammon
Published: (2013) -
Tool for Simulating Branch and Bound Computations
by: Ignatov Andrei, et al.
Published: (2020-05-01) -
Computing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
by: M.E. Abramyan
Published: (2021-09-01)