A Hamilton Path-Based Approach to DNA Sequence Analysis

Abstract

The Hamiltonian path is a famous algorithm for determining the existence or nonexistence of a graph. However, for certain types of graphs, we can apply certain conditions to determine its existence. In this paper, we discuss the results show that there can be at most (n-1)/2 edges disjoint Hamiltonian paths in a complete graph. Also, discussed examples of its applications in different fields. Furthermore, the application of Hamilton path in the DNA sequence has been investigated.