Time filter

Source Type

Wang Z.,Zhengzhou University of Light Industry | Wang Z.,Zhengzhou Eelectric Power College | Bian L.,Zhengzhou University of Light Industry | Bian L.,Zhengzhou Eelectric Power College | And 4 more authors.
Communications in Computer and Information Science | Year: 2014

The minimum spanning tree (MST) problem has been widely studied for its wide applicationsin 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. © Springer-Verlag Berlin Heidelberg 2014.


Wang Z.,Zhengzhou University of Light Industry | Bian L.,Zhengzhou University of Light Industry | Bian L.,Zhengzhou Eelectric Power College | Wang Y.,Zhengzhou University of Light Industry | Cui G.,Zhengzhou University of Light Industry
Journal of Computational and Theoretical Nanoscience | Year: 2015

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. Copyright © 2015 American Scientific Publishers.

Loading Zhengzhou Eelectric Power College collaborators
Loading Zhengzhou Eelectric Power College collaborators