The lecture introduces the problem of comparing two strings while allowing certain mismatches between the two. The problem will be referred to as (pairwise) sequence alignment. or inexact matching.
We first present the problem and provide biological motivation. We then define similarity and difference between strings and present algorithms for computing them, with analysis of the complexity of these algorithms.
The algorithms use the dynamic programming technique. For each algorithm the following information will be given: