Heuristic solution to a 10-city asymmetric traveling salesman problem using probabilistic DNA computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4848 LNCS, Issue , 2008, Pages 152-160

  Spetzler, David ^a   Xiong, Fusheng ^a   Frasch, Wayne D ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Denaturing PAGE; DNA computing; Hybridization; Ligation; Magnetic affinity; Traveling salesman problem

Indexed keywords

CALCULATIONS; DNA; GENES; GENETIC PROGRAMMING; HEURISTIC PROGRAMMING; NUCLEIC ACIDS; ORGANIC ACIDS; PROBABILITY; SEPARATION;

ANSWER SETS; ASYMMETRIC TRAVELING SALESMAN PROBLEM; CUMULATIVE WEIGHT; DENATURING PAGE; DNA COMPUTING; DNA HYBRIDIZATIONS; HYBRIDIZATION; IN-SILICO; LIGATION; MAGNETIC AFFINITY; OPTIMAL PATHS; PROBABILISTIC COMPUTATION; SINGLE COPY; TRAVELING SALESMAN; VERTEX PAIRS;

TRAVELING SALESMAN PROBLEM;

EID: 49949115632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77962-9_16     Document Type: Conference Paper

References (17)

1. Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021-1024 (1994)
2. Reif, J.H., LaBean, T.H., Sahu, S., Yan, H., Yin, P.: Design, simulation, and experimental demonstration of self-assembled DNA nanostructures and motors. Unconventional Programming Paradigms 3566, 173-187 (2005)
3. Seeman, N.C., Wang, H., Yang, X.P., Liu, F.R., Mao, C.D., Sun, W.Q., Wenzler, L., Shen, Z.Y., Sha, R.J., Yan, H., Wong, M.H., Sa-Ardyen, P., Liu, B., Qiu, H.X., Li, X.J., Qi, J., Du, S.M., Zhang, Y.W., Mueller, J.E., Fu, T.J., Wang, Y.L., Chen, J.H.: New motifs in DNA nanotechnology. Nanotechnology 9(3), 257-273 (1998)
4. Schmidt, K.A., Henkel, C.V., Rozenberg, G., Spaink, H.P.: DNA computing using single-molecule hybridization detection. Nucleic Acids Research 32(17), 4962-4968 (2004)
5. Shin, S.Y., Lee, I.H., Kim, D., Zhang, B.T.: Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. Ieee Transactions on Evolutionary Computation 9(2), 143-158 (2005)
6. Qu, H.Q., Zhu, H., Peng, C.: New algorithms for some NP-optimization problems by DNA computing. Progress in Natural Science 12(6), 459-462 (2002)
7. Shao, X.G., Jiang, H.Y., Cai, W.S.: Advances in biomolecular computing. Progress in Chemistry 14(1), 37-46 (2002)
8. Tostesen, E., Liu, F., Jenssen, T.K., Hovig, E.: Speed-up of DNA melting algorithm with complete nearest neighbor properties. Biopolymers 70(3), 364-376 (2003)
9. Kim, D., Shin, S.Y., Lee, I.H., Zhang, B.T.: NACST/Seq: A sequence design system with multiobjective optimization. DNA Computing 2568, 242-251 (2003)
10. Lipton, R.J.: DNA Solution of Hard Computational Problems. Science 268(5210), 542-545 (1995)
11. Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA solutions to chess problems. Proceedings of the National Academy of Sciences of the United States of America 97(4), 1385-1389 (2000)
12. Yamamoto, M., Kameda, A., Matsuura, N., Shiba, T., Kawazoe, Y., Ohuchi, A.: A separation method for DNA computing based on concentration control. New Generation Computing 20(3), 251-261 (2002)
13. Lee, J.Y., Shin, S.Y., Park, T.H., Zhang, B.T.: Solving traveling salesman problems with DNA molecules encoding numerical values. Biosystems 78(1-3), 39-47 (2004)
14. Hartmanis, J.: Response to the Essays on Computational-Complexity and the Nature of Computer-Science. Acm Computing Surveys 27(1), 59-61 (1995)
15. Tanaka, F., Kameda, A., Yamamoto, M., Ohuchi, A.: Design of nucleic acid sequences for DNA computing based on a thermodynamic approach. Nucleic Acids Res. 33(3), 903-911 (2005)
16. Xiong, F., Spetzler, D., Frasch, W.: Elimination of Secondary Structure for DNA Computing. In: Proceedings of DNA13 (2007)
17. Yamanishi, K., Yasuno, H.: Ligase chain reaction (LCR). Hum. Cell. 6(2), 143-147 (1993)