Needleman-Wunsch算法的改进

Improvement of Needleman-Wunsch Algorithm

为了实现双序列的全局快速比对,分析了Needleman-Wunsch算法的运算思路,并提出了一种改进的Needleman-Wunsch算法。改进算法通过在计算过程中不断截短比对序列的长度,减少无用数据的计算,提高了运算的效率。通过以相控阵雷达辐射源的搜索模式序列识别为例进行仿真试验,仿真实验证明改进算法与Needle-man-Wunsch算法相比,具有效率高、运行时间短的优势。

In order to compare two sequences globally and fast, the theory of Needleman-Wunsch Algorithm is analyzed, and a improvement of Needleman -Wunsch Algorithm is proposed. The improvement algorithm cut down the sequences,reduce computational complexity,and increases efficiency when it operates. Simulation experiments are conducted by using pattern recognition of phased array radar as an example,and demonstrate that the new algorithm is more efficient.