Needleman-Wunsch algorithm for global alignment - Python
HTML-код
- Опубликовано: 12 сен 2024
- Global Sequence Alignment & Needleman-Wunsch || step by step Python tutorial
In this video, we have created a simple python program to solve the global alignment problem using the Needleman Wunsch algorithm. Hopefully, this video will help you to get a better understanding of the algorithm and it will help students in their bioinformatics or biotechnology assignments.
THE CONCEPT OF GLOBAL ALIGNMENT AND NEEDLEMAN-WUNSCH
• Global Sequence Alignm...
LINK TO DOWNLOAD THE PYTHON CODE
drive.google.c...
OTHER VIDEOS THAT CAN HELP YOU TO UNDERSTAND THE TOPIC BETTER
PAM matrix
• PAM matrix
Scoring Matrices: Basic concept of scoring matrices
• Scoring Matrices: Basi...
Sequence similarity and identity
• Sequence similarity an...
The concepts of Homology
• The concepts of Homolo...
Sequence Comparison
• Sequence Comparison
LIKE COMMENT SHARE SUBSCRIBE
Please follow our other social accounts for more amazing contents
BioinformaticaFB
/ bioinformaticayt
BioinformaticaIG
BioinformaticaT
Hey man great video! You've got a small mistake in there. In the first while loop of the traceback procedure you have to change the "and" to a "or" otherwise the algorithm will leave some letters out when it comes to longer sequences.
legend
Here is the link to get all the sequence alignments with Needleman-Wunsch:
github.com/aryabiju37/Bio-Informatics
thanks :)
Thank you a lot for this interesting video
Very informative video Sir
Thank you!
Your implementation doesn't seem to allow for multiple valid optimal alignments to be found, which is part of Needleman-Wunsch.
splendid, thanks so much!
please upload more videos, there are very helpful
Thank you so much ! that was very helpful
It was quite helpful
Thanks, great video
with this sequences
sequence_1 = "TC"
sequence_2 = "ATC"
the aligment is
TC
TC
well explained
Is it optimal or maximal global alignment?
Can you please elaborate your questions?
In this video we have studied how we can find a generalized global alignment. The main goal is to maximise the alignment score while aligning the entire sequence. So we will get a optimal alignment while maximum possible alignment score.
Please let us know what do you mean by
Optimal Global Alignment and Maximal Global Alignment and what is the difference.
Here is a little detail for optimal global alignment: I'm working for first time and I think both are same.
Can tou please check that too?
The Needleman-Wunsch algorithm is still widely used for optimal global alignment, particularly when the quality of the global alignment is of the utmost importance. The algorithm assigns a score to every possible alignment, and the purpose of the algorithm is to find all possible alignments having the highest score
I think they have used "optimal" in a border sense. There are several ways in which we can align two sequences globally. But we use Needleman-Wunsch algorithm to get the alignment that have the highest alignment score, that is the optimal alignment.
Summary
1. More then one possible way to align sequences
2. Optimal alignment is that, which have the highest alignment score.
3. Needleman-Wunsch algorithm is used to predict the Optimal global Alignment
Is it helpful?
@@BioinformaticaYT Yeah, Thank you so much. Now, it makes some sense.
Actually, I am asked by instructor to do this:
Create a python program that finds the optimal global alignment and the maximal global alignment score using Needleman and Wunsch Algorithm for the following sequences:
CAGTTA
TGAC
Can you please tell how should I proceed?
I suggest you to watch the video and make changes according to you requirements. You can ask in this thread if you get stuck at any point.
You can also watch our video on Concept of global alignment before starting your programming itself for a better understanding
ruclips.net/video/ipp-pNRIp4g/видео.html
Thank you for the walk through, but the distracting dance music is not necessary. (We can play our own background-coding music ourselves. 🙂)
Noted brother 😊🤗