03-511/711, 15-495/856 Course Notes - Sept 2, 2010

Pairwise alignment continued

Alignment algorithms

The dynamic programs for sequence alignment compute a matrix a[i,j], which gives the scores of the optimal alignments of all prefixes. These algorithms have four components:

The details of each of these steps are what differentiate global, semi-global and local alignment.

Local Alignment

Note that :

Last modified: September 2, 2010.
Maintained by Dannie Durand (durand@cs.cmu.edu) and Annette McLeod.