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

DNA sequence alignment is the most commonly application in computational biology. It is essential pre-requisite of many other operations in computational biology applications. Optimal alignment for a large scale size DNA sequence dataset is a