Global Sequence Alignment: the Needleman-âWunsch Algorithm
Global Sequence Alignment: the Needleman-âWunsch Algorithm
Global Sequence Alignment: the Needleman-âWunsch Algorithm
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Now compute M(i,j) row by row. <br />
M(i,j) s 1 A! S! L! V! N! D! K!<br />
s 2 0 1 2 3 4 5 6 7 <br />
0 0 0 0 0 0 0 0 0 <br />
A! 1 0 1 1 1 1 1 1 1 <br />
L! 2 0 ? <br />
V! 3 0 <br />
N! 4 0 <br />
K! 5 0 <br />
D! 6 0 <br />
K! 7 0 <br />
M(i,j) = max(M(i-‐1, j) + 0, M(i, j-‐1) + 0, M(i-‐1, j-‐1) + t(i, j))