Open AccessHamiltonian path problem: the performance comparison deoxyribonucleic acid computing and the branch-and-bound method
Author(s) -
Anna Sergeenko,
Oleg Granichin,
Maria Yakunina
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1536/1/012003
Subject(s) - dna computing , hamiltonian path , hamiltonian path problem , hamiltonian (control theory) , path (computing) , dna , computer science , upper and lower bounds , branch and bound , algorithm , mathematics , mathematical optimization , theoretical computer science , chemistry , biochemistry , graph , mathematical analysis , computation , programming language
In this article different approaches to one of the most popular combinatorial problem — the Hamiltonian path problem – are illustrated and compared between each other. It is shown that it becomes inefficient to use branch-and-bound method, the most popular method which is realized on a computer, from the counted number of vertices because of its exponentially growing complexity, one more algorithm which is based on working with deoxyribonucleic acid (DNA) molecules in a laboratory is analysed. That method works parallel and has linearly growing time consumption. Due to the improvements in the biophysics methods, which are needed for DNA computing, that algorithm became much faster than it was several years ago and it is now possible to add some new stages in DNA computing, which are shown in this paper.