A Hamilton Path-Based Approach to DNA Sequence Analysis
O. K. Berdewad, Laeequr Raheman, V. A. Jadhav
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.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.