The Application of DNA Molecule Algorithm on the Graph's Connectivity Problem

被引：0

作者：

Wang, Yanchai ^{[1
]}

Liu, Fangfang ^{[2
]}

Song, Ming ^{[2
]}

Dong, Yafei ^{[1
,2
]}

机构：

[1] Shaanxi Normal Univ, Dept Comp Sci, Xian 710062, Peoples R China

[2] Shaanxi Normal Univ, Dept Life Sci, Xian 710062, Peoples R China

来源：

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE | 2015年 / 12卷 / 09期

基金：

中国国家自然科学基金;

关键词：

DNA Computing; DNA Molecule; Graph's Connectivity; COMPUTING MODEL; COMPUTATION;

D O I：

10.1166/jctn.2015.3997

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

A DNA computing algorithm is proposed in this paper which uses DNA molecule algorithm to solve an NP-complete problem in the Graph theory, algorithm model of the connectivity problem are also established. According to the algorithm we need to design the special DNA molecule which will assemble based on a specific graph, then a series of experiments are performed to get the final answer. This biochemical algorithm could reduce the complexity of the connectivity problem. The biochemical experimental technologies are mature and available, which will provide a practical way to validate the practicability and effect of DNA molecule algorithm model.

引用

页码：2117 / 2120

页数：4

共 50 条

[21] Simulation DNA Algorithm Model of Satisfiability Problem [J].

Zhou, Kang ;

Fan, Lili ;

Shao, Kai ;

Dong, Wenbo .

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) :1220-1227

[22] A Method for the Graph Vertex Coloring Problem Based on DNA Origami [J].

Ma Jingjing ;

Xu Jin .

JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2021, 43 (06) :1750-1755

[23] A Graph-Based Approach for the DNA Word Design Problem [J].

Luncasu, Victor ;

Raschip, Madalina .

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2021, 18 (06) :2747-2752

[24] Evolutionary DNA Computing Algorithm for Job Scheduling Problem [J].

Ibrahim, Gudar J. ;

Rashid, Tarik A. ;

Sadiq, Ahmed T. .

IETE JOURNAL OF RESEARCH, 2018, 64 (04) :514-527

[25] Algorithm of DNA computing model for gate assignment problem [J].

Yin, Zhixiang ;

Chen, Min ;

Li, Qingyan .

Advances in Intelligent Systems and Computing, 2013, 212 :299-305

[26] The molecular algorithm of the matching problem based on plasmid DNA [J].

Gao, L ;

Ma, RN ;

Xu, J .

PROGRESS IN BIOCHEMISTRY AND BIOPHYSICS, 2002, 29 (05) :820-823

[27] Solving application oriented graph theoretical problems with DNA computing [J].

Halasz, Veronika ;

Hegedues, Laszlo ;

Hornyak, Istvan ;

Nagy, Benedek .

PROCEEDINGS OF SEVENTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS (BIC-TA 2012), VOL 1, 2013, 201 :75-+

[28] Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem [J].

Cui, Guangzhao ;

Li, Cuiling ;

Zhang, Xuncai ;

Wang, Yanfeng ;

Qi, Xinbo ;

Li, Xiaoguang ;

Li, Haobin .

ADVANCES IN NEURAL NETWORKS - ISNN 2009, PT 3, PROCEEDINGS, 2009, 5553 :684-+

[29] Application of DNA Self-Assembly on 0-1 Integer Programming Problem [J].

Zhang, Xuncai ;

Niu, Ying ;

Cui, Guangzhao ;

Xu, Jin .

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2010, 7 (01) :165-172

[30] DNA Self-Assembly for Graph Vertex 3-Coloring Problem [J].

Wang, Yanfeng ;

Hu, Peipei ;

Shi, Xiaolong ;

Cui, Guangzhao .

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2012, 9 (12) :2086-2092

← 1 2 3 4 5 →