screen
screen
screen
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Global alignment.<br />
The Needleman-Wunsch<br />
algorithm<br />
<br />
<br />
<br />
<br />
Goal: find the maximal scoring alignment<br />
Scores: m match, -s mismatch, -g for<br />
insertion/deletion<br />
Dynamic programming<br />
– Solve smaller subproblem(s)<br />
– Iteratively extend the solution<br />
The best alignment for X[1…i] and Y[1…j] is<br />
called M[i, j]<br />
X 1<br />
… X i-1<br />
- - X i<br />
Y 1<br />
… - Y j-1<br />
Y j<br />
-
Change language