Solving traveling salesman problems with DNA molecules encoding numerical values

被引:93
作者
Lee, JY
Shin, SY
Park, TH
Zhang, BT
机构
[1] Seoul Natl Univ, Sch Chem Engn, Seoul 151744, South Korea
[2] Seoul Natl Univ, Sch Comp Sci & Engn, Seoul 151744, South Korea
关键词
DNA computing; melting temperature control encoding method; weight representation in DNA; traveling salesman problem;
D O I
10.1016/j.biosystems.2004.06.005
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradient polymerase chain reaction and temperature gradient gel electrophoresis. The proposed method was successfully applied to the traveling salesman problem, an instance of optimization problems on weighted graphs. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on logical problem solving. (C) 2004 Elsevier Ireland Ltd. All rights reserved.
引用
收藏
页码:39 / 47
页数:9
相关论文
共 16 条
[1]   MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].
ADLEMAN, LM .
SCIENCE, 1994, 266 (5187) :1021-1024
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]   Strand design for biomolecular computation [J].
Brenneman, A ;
Condon, A .
THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) :39-58
[4]   Molecular computation: RNA solutions to chess problems [J].
Faulhammer, D ;
Cukras, AR ;
Lipton, RJ ;
Landweber, LF .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (04) :1385-1389
[5]  
FOGEL DB, 2000, EVOLUTINARY COMPUTAT
[6]  
Kim D, 2003, LECT NOTES COMPUT SC, V2568, P242
[7]  
LEE JY, 2003, PREL P 9 INT M DNA B, P208
[8]   DNA Computation: Theory, Practice, and Prospects [J].
Maley, Carlo C. .
EVOLUTIONARY COMPUTATION, 1998, 6 (03) :201-229
[9]  
NARAYANAN A, 1998, P GEN PROGR, P718
[10]   DNA solution of the maximal clique problem [J].
Ouyang, Q ;
Kaplan, PD ;
Liu, SM ;
Libchaber, A .
SCIENCE, 1997, 278 (5337) :446-449