It is also called the Needleman-Wunsch algorithm which was developed by Saul Needleman and Christian Wunsch from Chicago and published in 1970.
It is called a Global Sequence Alignment. In other words, we aligned all the residues of the two sequences from end to end. As the last figure in the previous unit shows, we traced back from the lower-bottom corner of the dynamic programming matrix and ended at the upper-most corner (0,0). In this unit, we will continue on this topic. Last time we discussed how to construct pairwise sequence alignment using dynamic programming. Let's continue with our second topic: Sequence Alignment. I am Ge Gao from the Center of Bioinformatics, Peking University. Welcome back to Peking University MOOC: "Bioinformatics: Introduction and Methods".
0 kommentar(er)
