介绍动态编程之序列比对：Needleman-Wunsch 算法和Smith-Waterman算法-Sequence alignment of dynamic programming: needleman-wunsch gives you and Smith- Waterman algorithm

本文介绍基于最长公共子串的文本比较算法——Needleman/Wunsch算法。-In this paper, the text comparison algorithm based on the longest common substring Needleman/Wunsch algorithm