The Application Research of DNA Self-Assembly Computing for Solving the Minimum Spanning Tree

摘要

The minimum spanning tree (MST) problem has been widely studied, for its wide applications in recent years. Because of its outstanding advantages, DNA self-assembly computing has been used to solve MST problem. A new paradigm, called a three dimensional (3D) DNA self-assembly model, is proposed for this type of problem in this paper. The results show that it is efficient in solving MST problem and the algorithm has a high-efficiency.