2014 | OriginalPaper | Buchkapitel
A 3D DNA Self-assembly Model and Algorithm for Minimum Spanning Tree Problem
verfasst von : Zicheng Wang, Lizheng Bian, Yanfeng Wang, Guangzhao Cui
Erschienen in: Bio-Inspired Computing - Theories and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.