Dynamic Programing
Dynamic Programing
Dynamic Programing
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Smith-Waterman Algorithm (Cont.)<br />
Example<br />
Local alignment of V = THISLINE , W= ISALIGNED with gap = -4ngap , score matrix = BLOSUM62<br />
I S A L I G N E D<br />
0 0 0 0 0 0 0 0 0 0<br />
T 0 0 1 0 0 0 0 0 0 0<br />
H 0 0 0 0 0 0 0 1 0 0<br />
I 0 4 0 0 2 4 0 0 0 0<br />
S 0 0 8 4 0 0 4 1 0 0<br />
L 0 2 4 7 8 4 0 1 0 0<br />
I 0 4 0 3 9 12 8 4 0 0<br />
N 0 0 5 1 5 8 12 14 10 6<br />
E 0 0 1 4 1 4 8 12 19 15<br />
From: Understanding Bioinformatics by Zvelebil, Baum<br />
Traceback starts at entry containing the optimal alignment score.<br />
V:<br />
W:<br />
I S - L I - N E<br />
I S A L I G N E