关键词: DNA计算, k-臂分子, 粘贴模型, 最短路径

Abstract:

In order to solve the shortest path problem, avoid the difficulty of massive and long calculation of traditional computing method, DNA(Deoxyribo Nuclec Acid) computing is a method fit to solve complex problem because of the parallelism character. In this paper, a DNA algorithm to solve shortest path problem fo
r weighted graph based on k-armd molecule and sticker operation is proposed. The encoding method and solving process are described, the model proposed is feasible for short path problem.


Key words: DNA computing, k-armed molecule, sticker operation, shortest path