Local Sequence Alignment & Smith-Waterman || Algorithm and Example

Local Sequence Alignment & Smith-Waterman || Algorithm and Example

In this video, we have discussed how to solve the local sequence alignment in bioinformatics using the Smith-Waterman algorithm. In local alignment, we align the substrings or stretches of sequences with the highest similarities. In this video, we learn who we can solve a local alignment problem with very simple steps. Before watching this video make sure to watch our video on Global alignment.

Global Sequence Alignment & Needleman-Wunsch

SUBMIT YOUR DOUBTS HERE

VIDEOS THAT CAN HELP YOU TO UNDERSTAND THE TOPIC BETTER

BLOSUM matrix

PAM matrix

Scoring matrices: Basic concept of the scoring matrix

Sequence Comparison

LIKE COMMENT SHARE SUBSCRIBE

[dansabi]

The best so far, could not be much easier. You made me fall in love with Bioinformatics for the first time. God bless you

[DJmisterpeluca]

6:09 why is the second T from S1 and the last T from S2 a 0? From the technique explained shouldn't it be 1 since 0-2 = -2 = 0; but the T and T match so 0+1 = 1?

[inshrahtariq]

This is such a good video, and the way you make everything understandable is appreciative.

[mansi]

@6:09 shouldn't the T-T cell has a score of 1? (the third cell from left at the bottom)

[HOOMANESMAILIAN-mfyz]

Thank you sir for making the concept easier to understand. Please do make more videos.God bless u

[syedsalehhaider]

You have explained it very well, keep it up.

[melvinverdinanmulia]

Is the traceback step the same as the global sequence alignment?

[sokhibjonshokirov]

OMG this is super, it made very easy to understand the concept thanks and love for creators. Keep going in this way i will like to your all videos. 😊

[mohamedmahmoudfathy]

it is so easy & simple explanation but I have a question, we know that local alignment compare between highly similar regions in the two sequences but how the smithwaterman determines the highly similar regions before searching for the optimal alignments for them ???

[tonypepper]

Sir, i didn't understand How you got GCT as second sequence. Is it same like Needleman?.

Or is it like 3, 2, 1, 0. And 1, 0 from A-A?

And we dont need to go sideways? But if we have to stop, stop till 0 and continue with next highest number?

[ctechpro]

How do you get 0 from the cell ( T , T ) on the 3rd column and last row?

[glassfabrikat]

Thank you!! All your videos are great!! And super nice animations!

[numankhan]

Sir had helpful...
Love from pakistan..

[prabhu]

thank you so much sir!! great explanation!!

[abubakarbashir]

Marvelous, keep doing the great work. It is really helpful.
👍👍👍👍👍👍👍

[marianagonzales]

Thank you so much! your videos are great! 😊

[ganapathyk]

I guess in local alignment all positive values are considered to be 1 and all 0 and negative values are consider to be zero. So local alignment should be binary completely. Tell me if we can use major values as well

[omboke]

how dou u make the presentation using which software ?

[annmatt]

Thank you sir for making the concept easier to understand. Please do make more videos.

[smritisrivastava]

Thank you so much for such a wonderful explanation