Smith-Waterman算法是Smith和Waterman提出的一种用来寻找并比较具有局部相似性区域的动态规划算法，很多后来的算法都是在该算法的基础上发展的。(Smith-Waterman algorithm is a dynamic programming algorithm proposed by Smith and Waterman to find and compare local similarity regions, and many subsequent algorithms