关键词: 序列比对, Dijkstra算法, 最短路径, 有向无环图

Abstract: A sequence alignment algorithm based on Dijkstra algorithm is put forward, which is mainly used to seek the shortest path while the problem of sequence alignment can be transformed into a problem to look for the shortest path in directed acyclic graph. For a small amount of sequences, Dijkstra algorithm is easier to seek the optimal solution. For multiple sequences alignment, the shortest path seeked in the N-dimensional space can be obtained in the two-dimensional space. It can be proved that the problem is greatly simplified and the sub-optimal solution can be obtained.

Key words: sequence alignment, Dijkstra algorithm, shortest path, directed acyclic graph