BI - The Smith-Waterman Algortihm

Questions

• ?

---

IMPORTANTE

IMPORTANTE Smith-Waterman Algorithm Objective: find the best matching subsequence.

• Initialize the first row and first columns to $0$
• Set the miss match penalty to $-1$
• Enter a $0$ in the table whenever all other routes would return a negative score

Once the matrix is built:

• Find the maximum score in the matrix
• Proced backward and reconstruct the alignment until a $0$ is reached, this will be the best matching subsiquence

~Ex.: Rules

~Ex.: Algorithm

---

Slides with Notes

IMPORTANTE Smith-Waterman Algorithm Objective: find the best matching subsequence.

• Initialize the first row and first columns to $0$
• Set the miss match penalty to $-1$
• Enter a $0$ in the table whenever all other routes would return a negative score
  

Once the matrix is built:

• Find the maximum score in the matrix
• Proced backward and reconstruct the alignment until a $0$ is reached, this will be the best matching subsiquence

~Ex.: Algorithm