GIS integrated DNA computing for solving Travelling Salesman Problem

Abstract

DNA computing is a new method of simulating biomolecular structure of DNA and computing by means of molecular biology technological computation. It introduces a fire-new data structure and calculating method, providing a new way of solving NP-complete problem of traveling salesman. It is a new computational method by harnessing the enormous parallel computing ability and high memory density of bio-molecules, which brings potential challenges and opportunities to cryptography, steganography, Signature and Authentication. In this paper, DNA computing is integrated with GIS to find shortest path of traveling salesman problem with geocomputational method and DNA Computing method without using laboratory. Both methods show the same result proving that problems of GIS could be solved using DNA computing.