A Molecular Computing Model for Maximum Clique Problem Based on DNA Nanoparticles

被引:2
作者
Shen Lingjing [1 ]
Song Zhichao [2 ]
Wu Liuqing [3 ]
Dong Yafei [1 ]
机构
[1] Shaanxi Normal Univ, Coll Life Sci, Xian 710062, Peoples R China
[2] North China Elect Power Univ, Sch Control & Comp Engn, Beijing 102206, Peoples R China
[3] Peking Univ, Key Lab High Confidence Software Technol, Sch Elect Engn & Comp Sci, Inst Software,Minist Educ, Beijing 100871, Peoples R China
基金
中国国家自然科学基金;
关键词
DNA Computing; The Maximum Clique Problem; DNA/AuNPs; Electrophoresis; COMPUTATION;
D O I
10.1166/jctn.2014.3615
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
In this article, the maximum clique problem is solved based on a computing model using DNA/AuNP (gold nanoparticle). In this model, the DNA probes are used to link the specific DNA/AuNP structures in order to generate initial solution space, then specific recognizing DNA/AuNP structures are used to delete the false solutions. Finally, the true solution can be separated by electrophoresis. Different from conventional algorithm, the algorithm in this paper has high efficiency as its low time and space complexity (both are O(2n+ m+ 2)). What's more, the biological operation is convenient and fast for it doesn't need any enzyme. Both the operations of eliminating false solutions and obtaining the optimum solution only need to be carried out once. This model presents a different method to solve similar problems.
引用
收藏
页码:2120 / 2124
页数:5
相关论文
共 29 条
[11]   Tip-Based Nanofabrication as a Rapid Prototyping Tool for Quantum Science and Technology [J].
Herman, Aleksander .
REVIEWS IN THEORETICAL SCIENCE, 2013, 1 (01) :3-33
[12]  
Jing Y., 2010, SCHINCE CHINA, V8, P1078
[13]  
Karp R.M., 1972, PLENUM PRESS SURV ST, P85, DOI 10.1007/978-1-4684-2001-2_9
[14]   Solving traveling salesman problems with DNA molecules encoding numerical values [J].
Lee, JY ;
Shin, SY ;
Park, TH ;
Zhang, BT .
BIOSYSTEMS, 2004, 78 (1-3) :39-47
[15]   DNA SOLUTION OF HARD COMPUTATIONAL PROBLEMS [J].
LIPTON, RJ .
SCIENCE, 1995, 268 (5210) :542-545
[16]   Logical computation using algorithmic self-assembly of DNA triple-crossover molecules [J].
Mao, CD ;
LaBean, TH ;
Reif, JH ;
Seeman, NC .
NATURE, 2000, 407 (6803) :493-496
[17]  
MICHAEL H, 2005, BIOSYSTEMS, V80, P233
[18]  
Narayanan M., 2012, QUANTUM MATTER, V1, P53, DOI DOI 10.1166/QM.2012.1005
[19]  
Ono T., 2012, Quantum Matter, V1, P4, DOI DOI 10.1166/QM.2012.1002
[20]   DNA solution of the maximal clique problem [J].
Ouyang, Q ;
Kaplan, PD ;
Liu, SM ;
Libchaber, A .
SCIENCE, 1997, 278 (5337) :446-449