Clustal. W- Pairwise Alignments • First perform all possible pairwise alignments between each pair of sequences. There are (n-1)+(n-2). . . (n-n+1) possibilities. • Calculate the ‘distance’ between each pair of sequences based on these isolated pairwise alignments. • Generate a distance matrix.
Path graph for aligning two sequences
Possible alignment 1 Scoring Scheme: • Match: +1 • Mismatch: 0 • Indel: -1 1 0 1 Score for this path= 2 0 -1
Alignment using this path 1 1 GATTCGAATTC 0 1 0 -1
Optimal Alignment 1 Alignment using this path 1 1 GA-TTC GAATTC -1 1 1 Alignment score: 4 1
Optimal Alignment 2 ? Alignment score: 4
Optimal Alignment 2 1 Alignment using this path -1 G-ATTC GAATTC 1 1 1 Alignment score: 4 1
Clustal. W- Guide Tree • Generate a Neighbor-Joining ‘guide tree’ from these pairwise distances. • This guide tree gives the order in which the progressive alignment will be carried out.