DNA Computing for Eficient Encoding of Weights in the Traveling Salesman Problem

DNA computing suggests the potential of DNA with immense parallelism and huge storage capacity by solving NP-complete problems such as the traveling salesman problem (TSP). If DNA computing is used to solve TSP, however, weights between vertexes in sequence design cannot be encoded effectively. This study proposes an algorithm for code optimization (ACO) that applies DNA coding method to DNA computing in order to encode weights in TSP effectively. By applying ACO to TSP, we designed sequence more effectively than Adleman´s DNA computing algorithm. Furthermore, we could find the shortest path quickly and reduce biological error rate