SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING

被引：0
|
作者：
Liu Xikui Li Yan Xu JinDept of Control Science Eng Huazhong Univ of Science and Tech Wuhan China College of Engineering Tech Xuzhou Normal University Xuzhou China [430074 ,271019 ]
机构：
来源：
Journal of Electronics | 2005年 / 02期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
<正>Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.
引用
收藏
页数：6
相关论文
共 50 条
  • [1] Solving minimum spanning tree problem with DNA computing
    Liu, XK
    Yan, L
    Jin, X
    [J]. PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 184 - 188
  • [2] SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING
    Liu Xikui Li Yan Xu Jin(Dept of Control Science & Eng.
    [J]. Journal of Electronics(China), 2005, (02) : 112 - 117
  • [3] DNA computing model for the minimum spanning tree problem
    Han, Aili
    Zhu, Daming
    [J]. SYNASC 2006: EIGHTH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, PROCEEDINGS, 2007, : 372 - +
  • [4] DNA computing model for the minimum spanning tree problem
    Han, Aili
    Zhu, Darning
    [J]. Proc. Int. Symp. Symb. Numer. Algorithms for Sci. Comput., SYNASC, (372-377):
  • [5] Solving the Quadratic Minimum Spanning Tree Problem
    Cordone, Roberto
    Passeri, Gianluca
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (23) : 11597 - 11612
  • [6] A DNA computing model on triple-stranded for minimum spanning tree problem
    School of Science, Anhui University of Science and Technology, Huainan, China
    不详
    [J]. Fang, Xianwen, 1600, Springer Verlag (472):
  • [7] A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem
    Yin, Zhixiang
    Sun, Xia
    Xu, Feng
    Fang, Xianwen
    Xu, Hui
    [J]. BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2014, 2014, 472 : 549 - 551
  • [8] A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem
    Yin, Zhixiang
    Sun, Xia
    Xu, Feng
    Fang, Xianwen
    Xu, Hui
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1132 - 1137
  • [9] The Application Research of DNA Self-Assembly Computing for Solving the Minimum Spanning Tree
    Wang, Zicheng
    Bian, Lizheng
    Wang, Yanfeng
    Cui, Guangzhao
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1462 - 1466
  • [10] Solving the Minimum Spanning Tree Problem with a Quantum Annealer
    O'Quinn, Wesley
    Mao, Shiwen
    [J]. 2020 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2020,
12345