A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem

Author(s):  
Zhixiang Yin ◽  
Xia Sun ◽  
Feng Xu ◽  
Xianwen Fang ◽  
Hui Xu
2015 ◽  
Vol 12 (7) ◽  
pp. 1132-1137
Author(s):  
Zhixiang Yin ◽  
Xia Sun ◽  
Feng Xu ◽  
Xianwen Fang ◽  
Hui Xu

2013 ◽  
Vol 411-414 ◽  
pp. 2056-2061
Author(s):  
Zhi Li Pei ◽  
Qing Hu Wang ◽  
Jie Lian ◽  
Bin Wu

Artificial intelligence based on the genetic algorithm and DNA computing based on the biological intelligence is two kinds of important intelligent computing model, Graph theory and combinatorial optimization problem is a hotspot of research on intelligent computing. This paper designs a coding space optimized by using genetic algorithm, and by using DNA computing to solve Minimum Spanning Tree Problem calculation model. Because MSTP (Minimum Spanning Tree Problem) refer to Weight, IMCE (Incompletion-Molecule Commixed Encoding) is used in vertex, edges and weights encoding. The calculation process of the MSTP solution has been detailed described detailed.


1992 ◽  
Vol 23 (3) ◽  
pp. 1-12 ◽  
Author(s):  
Jungho Park ◽  
Ken'Ichi Hagihara ◽  
Nobuki Tokura ◽  
Toshimitsu Masuzawa

Sign in / Sign up

Export Citation Format

Share Document