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

被引：0

作者：

Yin, Zhixiang ^{[1
]}

Sun, Xia ^{[1
]}

Xu, Feng ^{[1
]}

Fang, Xianwen ^{[1
]}

Xu, Hui ^{[2
]}

机构：

[1] Anhui Univ Sci & Technol, Sch Sci, Huainan, Peoples R China

[2] Anhui Univ Sci & Technol, Sch Comp Sci & Engn, Huainan, Peoples R China

来源：

BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2014 | 2014年 / 472卷

基金：

中国国家自然科学基金;

关键词：

Triple-stranded DNA; Antigen intermediary; Minimum spanning tree problem;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Single-strand DNA can match with homologous double-stranded into a triple-stranded structure mediated by RecA protein. The paper provides a triple-stranded DNA computing model for minimum spanning tree problem. DNA fragments corresponding to edges are coded by double-stranded DNA, wrong hybridization does not take place and hairpin structure does not form. The single-strand DNA probe is bond with RecA protein, so the rate of wrong solution will reduce. And in this way, encoding complexity and the errors in computation will be decreased.

引用

页码：549 / 551

页数：3

共 50 条

[1] A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem
Yin, Zhixiang
Sun, Xia
Xu, Feng
Fang, Xianwen
Xu, Hui
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1132 - 1137
[2] A DNA computing model on triple-stranded for minimum spanning tree problem
School of Science, Anhui University of Science and Technology, Huainan, China
不详
Fang, Xianwen, 1600, Springer Verlag (472):
[3] The Minimum Spanning Tree Problem based on Triple-Stranded DNA Structure Model
Yang, Jing
Yin, Zhi-xiang
Chen, Ming-qiang
Huang, Kai-feng
APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (01): : 351 - 354
[4] DNA computing model for the minimum spanning tree problem
Han, Aili
Zhu, Daming
SYNASC 2006: EIGHTH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, PROCEEDINGS, 2007, : 372 - +
[5] DNA computing model for the minimum spanning tree problem
Han, Aili
Zhu, Darning
Proc. Int. Symp. Symb. Numer. Algorithms for Sci. Comput., SYNASC, (372-377):
[6] SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING
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
JournalofElectronics, 2005, (02) : 112 - 117
[7] Solving minimum spanning tree problem with DNA computing
Liu, XK
Yan, L
Jin, X
PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 184 - 188
[8] SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING
Liu Xikui Li Yan Xu Jin(Dept of Control Science & Eng.
Journal of Electronics(China), 2005, (02) : 112 - 117
[9] The Working Operation problem on Triple-stranded DNA Structure model
Yang, Jing
Yin, Zhi-xiang
Huang, Kai-feng
PROCEEDINGS OF THE 2009 WRI GLOBAL CONGRESS ON INTELLIGENT SYSTEMS, VOL IV, 2009, : 295 - +
[10] The postman problem based on Triple-stranded DNA Structure model
Yang, Jing
Yin, Zhi-xiang
Huang, Kai-feng
ISBE 2011: 2011 INTERNATIONAL CONFERENCE ON BIOMEDICINE AND ENGINEERING, VOL 1, 2011, : 483 - 486

← 1 2 3 4 5 →