Dynamic Programming Algorithm for Pairwise Sequence Alignment

In this video, Dynamic Programming algorithms, Needleman–Wunsch algorithm for Global Alignment and Smith–Waterman algorithm for Local Alignment are explained with examples. Here, creating the matrix, formulae to be used to fill the matrix, back tracking the path and aligning the sequences based on the path obtained are described.