Solving Shortest Hamiltonion Path Problem Using DNA Computing

Hala Mohammed, Alshamlan Mohammed, El Menai
Deoxyribonucleic acid (DNA) computing fundamentally being similar to parallel computing provides a nice way to make trillions of similar calculations in less than moment. Moreover, DNA computing has ability to solve main NP-complete problems such as Hamilton Path Problem, 3-SAT Problem, and Maximum Clique Problem. In this paper, we apply DNA computing to solve Shortest Hamiltonian Path Problem using two steps. First one, determine all Hamiltonian path from specific weighted graph, and then, in
more » ... raph, and then, in second step, we select the shortest one and return it as solution of our problem.