Hamiltonian path problem solution using DNA computing

Abstract

In this article we study DNA computing, a method which is based on working with DNA molecules in a lab-oratory. That approach is implemented in solving one of the most popular combinatorial problem — the Hamiltonian path problem. Related to recent improvements in the biophysics methods, which are needed for DNA computing, we propose to change some steps in the clas-sical algorithm to increase accuracy of this method. The branch-and-bound method, the most popular method which is realized on a computer, is also shown in this pa-per to compare its performance with the time consump-tion of DNA computing. The results of that compari-son prove that it becomes inefficient to use the branch-and-bound method from the counted number of vertices because of its exponentially growing complexity, while DNA computing works parallel and has linearly growing time consumption.