摘要： The local alignment problem for two sequences requires determining similar regions, one from each sequence, and aligning those regions. The Smith-Waterman algorithm for local sequence alignment is one of the most well-known algorithm in computational mole

关键词: 生物信息学 动态扣分策略 序列 局部联配算法 马赛克问题 Smith-Waterman算法 相似性 记分函数