Three-helix structure of the DNA molecule provided by the emergence of a new type of computing model, it has high stability, low rate of wrong solutions, easy separation and so on. Especially during the reaction data pool and the final solution was to come in the form of double-stranded, so avoid the hairpin structure, greatly improved the correct rate of solution. Minimum spanning tree problem is a NP-difficult problems in graph theory, which is looking for the tree contains all vertices and the smallest right of an undirected graph. We will attempt using of triplex DNA computing model for this article to solve the minimum spanning tree problem in graph theory.
Digital Object Identifier (DOI)
Yang, Jing; Yin, Zhi-xiang; Chen, Ming-qiang; and Huang, Kai-feng
"The Minimum Spanning Tree Problem based on Triple-Stranded DNA Structure Model,"
Applied Mathematics & Information Sciences: Vol. 08:
1, Article 44.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss1/44