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 条

[31] Application of DNA Nanoparticle Conjugation on the Hamiltonian Path Problem [J].

Ma, Jingjing .

JOURNAL OF NANOELECTRONICS AND OPTOELECTRONICS, 2021, 16 (03) :501-505

[32] Application of DNA Nanoparticle Conjugation on the Maximum Matching Problem [J].

Ma Jingjing ;

Xu Jin .

JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2021, 43 (10) :2952-2957

[33] A Molecular Computing Model for Graph Coloring Problem Using DNA Quantum Dot [J].

Li, Jiawei ;

Song, Zhichao ;

Zhang, Cheng ;

Yang, Jing ;

Schlaberg, H. Inaki ;

Liu, Shi .

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) :1272-1276

[34] A surface-based DNA algorithm for the maximal clique problem [J].

Pan, LQ ;

Xu, J ;

Liu, YC .

CHINESE JOURNAL OF ELECTRONICS, 2002, 11 (04) :469-471

[35] A parallel algorithm for solving sat problem based on dna computing [J].

Darehmiraki, M. .

International Journal of Computers and Applications, 2009, 31 (02) :128-131

[36] A random walk DNA algorithm for the 3-SAT problem [J].

Liu, WB ;

Gao, L ;

Zhang, Q ;

Xu, GD ;

Zhu, XG ;

Liu, XR ;

Jin, X .

CURRENT NANOSCIENCE, 2005, 1 (01) :85-90

[37] The Improvement of DNA Algorithm to the Directed Shortest Hamilton Path Problem [J].

Wang, Zhenye ;

Zhang, Qian ;

Dong Yafei .

2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, :241-244

[38] DNA Computing Algorithm to Solve the Least Maximal Matching Problem [J].

Zhang, Lingmin ;

Huang, Dongmei ;

Wang, Zhaocai ;

Ji, Zuwen .

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (09) :2348-2351

[39] DNAVS: an algorithm based on DNA-computing and vortex search algorithm for task scheduling problem [J].

Nillofar Jazayeri ;

Hedieh Sajedi .

Evolutionary Intelligence, 2021, 14 :1763-1773

[40] DNAVS: an algorithm based on DNA-computing and vortex search algorithm for task scheduling problem [J].

Jazayeri, Nillofar ;

Sajedi, Hedieh .

EVOLUTIONARY INTELLIGENCE, 2021, 14 (04) :1763-1773

← 1 2 3 4 5 →