Global Sequence Alignment: the Needleman-âWunsch Algorithm

More documents

Recommendations

Info

Now compute M(i,j) row by row. M(i,j) s 1 A! S! L! V! N! D! K! s 2 0 1 2 3 4 5 6 7 0 0 0 0 0 0 0 0 0 A! 1 0 1 1 1 1 1 1 1 L! 2 0 1 1 2 2 2 2 2 V! 3 0 1 1 2 3 3 3 3 N! 4 0 1 1 2 3 4 4 4 K! 5 0 1 1 2 3 4 4 5 D! 6 0 1 1 2 3 4 5 5 K! 7 0 1 1 2 3 4 5 6 M(7,7) = 6, so <strong>the</strong> opLmal match count is six!
How do we construct an opLmal alignment from this table?
Page 1 and 2: Global Sequence Alignment: the
Page 3 and 4: What is the intuiLon behind s
Page 5 and 6: Why align sequences? • Alignme
Page 7 and 8: Why align sequences? Alignments
Page 9 and 10: There are many possible alignme
Page 11 and 12: Which is the best alignment? s
Page 13 and 14: Idea: How can we find an opLm
Page 15 and 16: So what can we do?
Page 17 and 18: Some NotaLon • s 1 [1..i] = t
Page 19 and 20: The Key Insight • Think about
Page 21 and 22: Dynamic Programming Approach •
Page 23 and 24: Start with base condiLons D(i,j
Page 25 and 26: Now compute M(i,j) row by row.
Page 27: Now compute M(i,j) row by row.
Page 31 and 32: Is this algorithm feasible? •
Page 33 and 34: When would you want a local a

Global Sequence Alignment: the Needleman-âWunsch Algorithm

Create successful ePaper yourself

Delete template?

Save as template?

Global Sequence Alignment: the Needleman-âWunsch Algorithm