This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic programming ... we will study the ...

the dynamic programming algorithm will happily align unrelated sequences. (The two sequences in Figure 1 might look well-aligned; but in fact, they are unrelated, randomly generated DNA sequences!) ...

For example, the Smith-Waterman and Needleman-Wunsch dynamic programming algorithms are used for DNA sequence alignment, protein classification and protein folding. Both use a scoring method to ...