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 algor