Journal of Proteomics & Bioinformatics
Open Access

Solving shortest hamilinion path problem using DNA computing

2^nd International Conference on Proteomics & Bioinformatics

July 2-4, 2012 Embassy Suites Las Vegas, USA

Hala Mohammed, Alshamlan Mohammed and El Bachir Menai

Accepted Abstracts: J Proteomics Bioinform

Abstract :

DNA computing fundamentally being similar to parallel computing provides a nice way to make trillions of similar calculations in a moment. DNA computing have solve main and important 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 Hamilton path from specific weighted graph, and then in second step we select the shortest one and return it assolution of our problem.