Pairwise sequence alignment
To introduce the basic principles of pairwise sequence alignment.
After this lecture you will:
be aware of simple measures of sequence similarity;
understand the relationship between dotplots and sequence alignments;
understand how a dynamic programming algorithm finds an optimal
pairwise sequence alignment;
understand the difference between global and local alignment algorithms.
The lecture handout, featuring some of the lecture slides, is
Web-based programs illustrating topics from the lecture:
Programs described in the lecture (local access only):
Last Modified: 16 January 2012
by Graham Kemp