用smithwaterman算法做局部序列匹配。如在程序中给出了测试给定的两个基因序列是否匹配的例子-To do with smithwaterman local sequence matching algorithm. If the test is given in the program given two examples of gene sequences match

这个verilog代码实现的是DNA sequence alignment的功能-The verilog code is DNA sequence alignment function

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

Smith-Waterman算法是Smith和Waterman提出的一种用来寻找并比较具有局部相似性区域的动态规划算法，改进算法在其基础上可以输出所有最大分值的局部比对结果。(Smith-Waterman algorithm is a dynamic programming algorithm proposed by Smith and Waterman to find and compare local similarity regi