DNA Algorithm Based on K-Armed Molecule and Sticker Model for Shortest Path Problem
DNA computing is a computing paradigm based on biochemical reactions by using DNA molecule. Because of its advantages, such as mass storage and parallelism, it has been used to solve many complex problems. Shortest path problem is a frequently used problem in practical application. In this paper, a DNA algorithm based on k-armd molecule and sticker model to solve shortest path problem for weighted graph is proposed. The encoding method for the vertex, edges and weights is described in detail. This method shorten the length of the DNA strands for the weight code and may decrease the error during the biochemical reaction in a certain degree. The solving process for shortest path problem is also described in this paper.
KeywordsDNA computing k-armed molecule sticker model shortest path problem
Unable to display preview. Download preview PDF.
- 4.Shin, S.Y., Zhang, B.T., Jun, S.S., et al.: Solving traveling salesman problems using molecula programming. In: Proc of the 1999 Congress on Evolutionary Computation, pp. 994–1000. IEEE Press (1999)Google Scholar