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
   • Global Sequence Alignment & Needleman...  


SUBMIT YOUR DOUBTS HERE
https://forms.gle/HoVceAjz28tqvGdn9



VIDEOS THAT CAN HELP YOU TO UNDERSTAND THE TOPIC BETTER

BLOSUM matrix
   • BLOSUM matrix  

PAM matrix
   • PAM matrix  

Scoring matrices: Basic concept of the scoring matrix
   • Scoring Matrices: Basic concept of sc...  

Sequence Comparison
   • Sequence Comparison  

LIKE COMMENT SHARE SUBSCRIBE