Browse > Article

Code Optimization in DNA Computing for the Hamiltonian Path Problem  

김은경 (공주대학교 컴퓨터공학과)
이상용 (공주대학교 정보통신공학부)
Publication Information
Journal of KIISE:Software and Applications / v.31, no.4, 2004 , pp. 387-393 More about this Journal
Abstract
DNA computing is technology that applies immense parallel castle of living body molecules into information processing technology, and has used to solve NP-complete problems. However, there are problems which do not look for solutions and take much time when only DNA computing technology solves NP-complete problems. In this paper we proposed an algorithm called ACO(Algorithm for Code Optimization) that can efficiently express DNA sequence and create good codes through composition and separation processes as many as the numbers of reaction by DNA coding method. Also, we applied ACO to Hamiltonian path problem of NP-complete problems. As a result, ACO could express DNA codes of variable lengths more efficiently than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could reduce search time and biological error rate by 50% and could search for accurate paths in a short time.
Keywords
Hamiltonian path problem; DNA computing; DNA coding method; NP-complete problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. D. Watson, M. Gliman, J. Wikowski, M. Zoller, Recombinant DNA, 2nd Ed., Scientific American Books, New York, 1992
2 L. M. Adleman, 'Molecular computation of solutions to combinatorial problems,' Science, 266: 1021-1024, 1994   DOI
3 M. Ogihara, A. Ray, Executing Parallel Logical Operations with DNA, In Proceedings of the IEEE Congress on Evolutionary Computation, pp. 972-979, 1999   DOI
4 J. A. Rose, R. J. Deaton, D. R. Franceschetti, M. Garzon, and S. E. Jr. Stevens, 'A Statistical Mechanical Treatment of Error in the Annealing Biostep of DNA Computation,' In [GECC099], pp. 1829-1834
5 R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, S. E. Jr. Stevens, 'A DNA based implementation of an evolutionary search for good encodings for DNA computation,' Proceedings of IEEE Conference on Evolutionary Computation, IEEE Press, pp. 267-271, 1997   DOI
6 T. Yoshikawa, T. Furuhashi, Y. Uchidawa. 'The Effect of Combination of DNA Coding Method with Pseudo-Bacterial GA,' Proceeding of the 1997 IEEE International Intermag. 97 Magnetics Conference 1997   DOI
7 A. Salomaa, DNA complementarity and paradigms of computing, Turku Centre for Computer Science TUCS Technical Reports, No.457, 2002
8 N. Jonoska, N. C. Seedman (Eds.), 'Preliminary Proceedings of 7th International Meeting on DNA Based Computers,' University of South Florida, Tampa, FL, June, 10-13, 2001
9 R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, S. E. Jr. Stevens, 'Reliability and efficiency of a DNA-based computation,' Physical Review Letters, 82(2) : 417-420, 1998   DOI   ScienceOn
10 M. Yamamoto, J. Yamashita, T. Shiba, T. Hirayama, S. Takya, K. Suzuki, M. Munekata, A. Ohuchi, 'A Study on the Hybridiztation Process In DNA Computing,' In [DNA-V], pp. 99-108, 1999
11 T. Yoshikawa, T. Furuhashi, Y. Uchidawa, 'Acquisition of Fuzzy Rules of Constructing Intelligent Systems using Genetic Algorithm based on DNA Coding Method,' Proceedings of International Joint Conference of CFSA/IFIS/SOFT'95 on Fuzzy Theory and Applications, 1995
12 A. Brenneman and A. E. Condon, 'Strand Design for Bio-Molecular Computation,' Dept. of Computer Science, University of British Columbia, March 22, 2001