title: A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
abstract: The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms.
authors.affiliation: College of Information, Shanghai Ocean University, Shanghai 201306, PR China. zcwang1028@163.com
authors.forename: Zhaocai
authors.initials: Z
authors.lastname: Wang
authors.forename: Dongmei
authors.initials: D
authors.lastname: Huang
authors.forename: Huajun
authors.initials: H
authors.lastname: Meng
authors.forename: Chengpei
authors.initials: C
authors.lastname: Tang
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D039301:Computers, Molecular; D008962:Models, Theoretical
keywords: Adleman–Lipton model; DNA computation; NP-complete problem; The minimum spanning treeproblem