Needleman Wunsch Algorithm|| Dynamic Programming|| Bioinformatics|| Part # 02 (Example)

  Рет қаралды 33,487

Bio Scholar

Bio Scholar

Күн бұрын

Пікірлер: 33
@amanjaved3095
@amanjaved3095 8 ай бұрын
This video really helped to understand how to fill in the table. Thank you so much
@edobajoyce
@edobajoyce 3 ай бұрын
Whoaa! Eureka!! it wasn't so hard after listening to every explanation. Merci!!
@BioScholar971
@BioScholar971 3 ай бұрын
You're welcome! I'm glad the explanation helped. If you have any more questions or need further assistance, feel free to ask.
@mynameisminhhoang
@mynameisminhhoang 4 ай бұрын
Thank you so much, it helps me pass the test. Wish you the best
@BioScholar971
@BioScholar971 4 ай бұрын
You're very welcome! I'm so glad I could help you pass the test. Thanks for sharing your experience. Your feedback is highly appreciated.
@victorpeng5355
@victorpeng5355 6 ай бұрын
sure is tricky but definitely helped! thank you
@Akam_J_Mustafa
@Akam_J_Mustafa 8 ай бұрын
Well done 👏, this video really helped me to understand NW algorithm matrix. Thanks
@BioScholar971
@BioScholar971 8 ай бұрын
Glad it helped!
@adamoadam6244
@adamoadam6244 Ай бұрын
Isn't T A - T G A T A C - G A with gaps, so the best alignment would be TACTGA ?
@DimitriTrubetskoy
@DimitriTrubetskoy 2 ай бұрын
Great. thanks as well. Now it is clear. Though, you could explain it even a little bit more, with some shifting square for example, and explaining where each number is coming from every time. Even if you said that technically, it's not obvious from the first approach. Thanks anyways
@BioScholar971
@BioScholar971 2 ай бұрын
You're welcome! Thank you for sharing your feedback. I appreciate your suggestions and will keep them in mind for future explanations.
@erikOHsix06
@erikOHsix06 Жыл бұрын
so what is the possible alignment at the end? I can't see it because the "Bio Scholar" logo is in the way
@BioScholar971
@BioScholar971 Жыл бұрын
T A T G A T A C G A
@santiagovega6870
@santiagovega6870 Жыл бұрын
hello! I understand that negative values ​​are placed directly as 0, so the first row and the first column are all 0
@BioScholar971
@BioScholar971 Жыл бұрын
In the Smith-Waterman algorithm, the matrix is initialized with zeros on both sides. However, in the Needleman algorithm, the matrix is initialized by progressively incorporating gap penalties from the start. If you have any other question feel free to ask.
@justem_things7016
@justem_things7016 10 ай бұрын
sir i think the value for 5th column and 2nd row is wrong ie., for G and T respectively. please have a look and if not please clear by doubt
@BioScholar971
@BioScholar971 10 ай бұрын
(For G and T) Incorporate gap penalties when assessing the top and left values: Top value: (−8)+(−2)=−10 Left value: (−3)+(−2)=−5 Add the mismatch penalty when considering the diagonal value: Diagonal value: (−6)+(−1)=−7 From these computed values (-10, -5, and -7), select the highest, which is -5.
@anandsagar1351
@anandsagar1351 6 ай бұрын
thankyou .. by mistake i was also doing the wrong and having same doubt now it is clear.
@justsmile2me
@justsmile2me Жыл бұрын
I'm curious if the opening gap penalty and extension gap penalty is different.
@BioScholar971
@BioScholar971 Жыл бұрын
Yes, the opening gap penalty and extension gap penalty are typically different. The opening gap penalty is the penalty incurred for starting a gap in the alignment, while the extension gap penalty is the penalty incurred for continuing an existing gap. If the alignment algorithm is aligning two sequences that are very similar and there are no significant insertions or deletions. In this case, the algorithm may choose to use the same gap penalty for both opening and extending gaps in order to favor more aligned positions.
@UCSRAHULMAURYA
@UCSRAHULMAURYA 5 ай бұрын
does match and mismatch scores are pre decided as 1 and -1 or it can be changed?....can match score be assumed as +5 and mismatch as -1??
@ramizj.m5675
@ramizj.m5675 5 ай бұрын
All of the scoring systems of sequence alignment are arbitrary, except for those which aim to assess the biological properties of the sequences for a possible substitution of an amino acid with another one. So theoretically yes you can change those reward/penalty points as long as you use the same values for all the alignment scores.
@Nandhini-s2m
@Nandhini-s2m Ай бұрын
3rd row and 3rd c and t how to 1 please explain that
@BioScholar971
@BioScholar971 Ай бұрын
Check description, Pdf link is mentioned.
@nitehok600
@nitehok600 Жыл бұрын
what would be the alignment score and how do you find it?
@BioScholar971
@BioScholar971 Жыл бұрын
For match score is (1) and for mismatch score is (-1). So, the overall score for the alignment is 3. T A C G A T A T G A +1 +1 (-1) +1 +1 +4 -1 =3
@BioScholar971
@BioScholar971 Жыл бұрын
If you have any other question feel free to ask.
@nitehok600
@nitehok600 Жыл бұрын
@@BioScholar971 For the second sequence above, you mean 'G' not 'C' right?
@BioScholar971
@BioScholar971 Жыл бұрын
Yes, its G not C
@nitehok600
@nitehok600 Жыл бұрын
@@BioScholar971 In what case would there be a dash in the alignment?
@nitehok600
@nitehok600 Жыл бұрын
I think the traceback path you took and the alignment was wrong, if you go vertical or horizontal there should be a dash on the letter you go towards. Your alignment would be (T A - T G A / T A C - G A) if you choose to go left at 1.
@BioScholar971
@BioScholar971 Жыл бұрын
Traceback is correct, dash or hyphen is used to indicate indels.
Cell membrane: Structure and Functions|| Biology.
4:16
Bio Scholar
Рет қаралды 18 М.
Understanding Sequence Alignment Algorithms: with Needleman-Wunsch
12:12
Professor Hendrix
Рет қаралды 50 М.
Un coup venu de l’espace 😂😂😂
00:19
Nicocapone
Рет қаралды 9 МЛН
My Daughter's Dumplings Are Filled With Coins #funny #cute #comedy
00:18
Funny daughter's daily life
Рет қаралды 25 МЛН
когда не обедаешь в школе // EVA mash
00:51
EVA mash
Рет қаралды 4,3 МЛН
إخفاء الطعام سرًا تحت الطاولة للتناول لاحقًا 😏🍽️
00:28
حرف إبداعية للمنزل في 5 دقائق
Рет қаралды 65 МЛН
Introduction to Bioinformatics - Needleman Wunsch Algorithm
35:44
Global Sequence Alignment & Needleman-Wunsch || Algorithm and Example
11:33
Query, Key and Value Matrix for Attention Mechanisms in Large Language Models
18:21
Mastering Dynamic Programming - How to solve any interview problem (Part 1)
19:41
global sequence alignment
14:28
Deborah Thurtle-Schmidt
Рет қаралды 108 М.
Bioinformatics par 14: Dot plot
13:59
Shomu's Biology
Рет қаралды 67 М.
AES: How to Design Secure Encryption
15:37
Spanning Tree
Рет қаралды 165 М.
Reinforcement Learning, by the Book
18:19
Mutual Information
Рет қаралды 98 М.
Un coup venu de l’espace 😂😂😂
00:19
Nicocapone
Рет қаралды 9 МЛН