The alignment of two sequences
In this example, the distance between the two sequences is 3.
Following our definition of wsupp, wins, and wsub, this means we need 3 operations to transform a into b.
Since there is two paths resulting in a minimum distance, there is two possible alignments .