Solving traveling salesman problems with DNA molecules encoding numerical values.

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.

[1]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems using molecular programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  David B. Fogel,et al.  Evolutionary computation - toward a new philosophy of machine intelligence (3. ed.) , 1995 .

[3]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[6]  Ajit Narayanan,et al.  DNA algorithms for computing shortest paths , 1998 .

[7]  Byoung-Tak Zhang,et al.  NACST/Seq: A Sequence Design System with Multiobjective Optimization , 2002, DNA.

[8]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[9]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[10]  Carlo C. Maley,et al.  DNA Computation: Theory, Practice, and Prospects , 1998, Evolutionary Computation.

[11]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[12]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..

[13]  K Sakamoto,et al.  Molecular computation by DNA hairpin formation. , 2000, Science.

[14]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[15]  In-Hee Lee,et al.  Evolutionary sequence generation for reliable DNA computing , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[16]  J. SantaLucia,et al.  A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[17]  J. Wetmur.  DNA probes: applications of the principles of nucleic acid hybridization. , 1991, Critical reviews in biochemistry and molecular biology.

[18]  Anne Condon,et al.  Strand design for biomolecular computation , 2002, Theor. Comput. Sci..