Journal of the Korean Institute of Intelligent Systems (한국지능시스템학회논문지)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

A DNA Sequence Generation Algorithm for Traveling Salesman Problem using DNA Computing with Evolution Model

DNA 컴퓨팅과 진화 모델을 이용하여 Traveling Salesman Problem를 해결하기 위한 DNA 서열 생성 알고리즘

  • Published : 2006.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

Recently the research for Traveling Salesman Problem (TSP) using DNA computing with massive parallelism has been. However, there were difficulties in real biological experiments because the conventional method didn't reflect the precise characteristics of DNA when it express graph. Therefore, we need DNA sequence generation algorithm which can reflect DNA features and reduce biological experiment error. In this paper we proposed a DNA sequence generation algorithm that applied DNA coding method of evolution model to DNA computing. The algorithm was applied to TSP, and compared with a simple genetic algorithm. As a result, the algorithm could generate good sequences which minimize error and reduce the biologic experiment error rate.

현재 막대한 병렬성을 갖는 DNA 컴퓨팅을 이용하여 Traveling Salesman Problem (TSP)를 해결하기 위한 연구가 진행되고 있다. 하지만 기존의 방법은 그래프 문제의 표현에서 DNA의 특성을 고려하지 않아, 실제 생물학적 실험 결과와의 차이가 발생하고 있다. 따라서 DNA의 특성을 반영하고 생물학적 실험 오류를 줄일 수 있는 DNA 서열 생성 알고리즘이 필요하다. 본 논문에서는 DNA 컴퓨팅에 진화 모델의 하나인 DNA 코딩 방법을 적용한 DNA 서열 생성 알고리즘을 제안한다. 제안한 알고리즘은 TSP에 적용하여 기존에 단순 유전자 알고리즘과 비교하였다. 그 결과 제안한 알고리즘은 오류를 최소화한 우수한 서열을 생성하고 생물학적 실험 오류율도 줄일 수 있었다.

Keywords

References

  1. C. H. Papadmitriou, Computational Complexity, 1994
  2. J. A. Rose, R. J. Deaton, D. R. Franceschetti, M. Garzon.S. E. Jr. Stevens, 'A Statistical Mechanical Treatment of Error in theAnnealing Biostep of DNA Computation', In [GECCO99], pp. 1829-1834, 1999
  3. A. J. Hartemink, D. K. Gifford, and J. Khodor, 'Automated constraint based nucleotide sequence selection for DNA computation', in Proc. 4th DIMACS Workshop DNA Based Comput., pp. 227-235, 1998
  4. R. Penchovsky and J. Ackermann, 'DNA library design for molecular computation', J. Comput. Bio., Vol. 10, No.2, pp. 215-229, 2003 https://doi.org/10.1089/106652703321825973
  5. U. Feldkamp, S. Saghafi, W. Banzhaf, and H. Rauhe, 'DNA sequence generator- A program for the construction of DNA sequences', in Proc. 7th Int. Workshop DNA Based Comput., pp. 179-188, 2001
  6. L. M. Adleman, 'Molecular computation of solutions to combinatorial problems', Science, Vol. 266, pp. 1021-1024, 1994 https://doi.org/10.1126/science.7973651
  7. 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
  8. A. Narayanan, S. Zorbalas, ' DNA algorithms for computing shortest paths', Genetic Programming 1998, Koza, J. R. et al. (eds.), Morgan Kaufmann, pp. 718-723, 1998
  9. D. Faulhammer, A. R. Cukras, R. J. Lipton, and L. F. Landweber, 'Molecular computation: RNA solutions to chess problems', in Proc. Natl. Acad. Sci. U.S.A., Vol. 97, pp. 1385-1389, 2000 https://doi.org/10.1073/pnas.97.4.1385
  10. S. Kashiwamura, A. Kameda, M. Yamamoto, and A. Ohuchi, 'Two-step search for DNA Sequence Design', Proceedings of the 2003 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 03), pp. 1815-1818, 2003

Cited by

  1. Solution to the 0-1 Knapsack Problem based on DNA Encoding and Computing Method vol.8, pp.3, 2013, https://doi.org/10.4304/jcp.8.3.669-675