Global Sequence Alignment: the Needleman-âWunsch Algorithm
Global Sequence Alignment: the Needleman-âWunsch Algorithm
Global Sequence Alignment: the Needleman-âWunsch Algorithm
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The Key Insight <br />
• Think about <strong>the</strong> last column of an opLmal <br />
alignment. <br />
• Four possibiliLes (where X, Y are characters): <br />
X!<br />
-!<br />
-!<br />
X!<br />
⇒ M(n-‐1, m) is opLmal <br />
for s 1 [1..n-‐1] and s 2 [1..m] <br />
⇒ M(n, m-‐1) is opLmal <br />
for s 1 [1..n] and s 2 [1..m-‐1] <br />
X!<br />
Y!<br />
X!<br />
X!<br />
⇒ M(n-‐1, m-‐1) is opLmal <br />
for s 1 [1..n-‐1] and s 2 [1..m-‐1] <br />
⇒ M(n-‐1, m-‐1) is opLmal <br />
for s 1 [1..n-‐1] and s 2 [1..m-‐1]
Change language