3.3 Dynamic programing, global alignment

Sequence alignment methods often use something called a "dynamic programming" algorithm. Here we introduce dynamic programming for the global alignment of biomolecular sequences.
Reordered for BIMM143. For more details see:
thegrantlab.org...

[@lassiholik]

This was the one I needed! 3 mins in and I can go code this up now. The rest are hard to stay focused and don't start with the essence of the algorithm. The only criticism is the reference to other videos, better when completely self contained. You're very talented at this. All the best! Thanks.

[@booyah5021]

Excellent explanation

[@fadysensei]

Thank you

[@arslantariqable]

How we can generate the matrix if there is a gap opening penalty and gap extension penalty. e.g.
Match= +1
mismatch = -1
gap opening = -3
gap extension = -2

[@biniyamhailu2429]

thank you a lot!

[@BarryGrant]

You're welcome!

[@firatkurt4289]

Purrfect :)

[@cigdemozen5005]

Hi Prof. Grant,
Thank you very much again!
Is there a rule about which sequence should be on top or bottom right? Or do we choose it completely arbitrarily?
Best,
Cigdem

[@BlokeBritish]

what about aligning words like
abcde
bedca

[@hebaallah.hashim6579]

thanks so much, can u share the slides too ?