Тёмный

Sequence Alignment | Needleman Wunsch in Python 

Aladdin Persson
Подписаться 81 тыс.
Просмотров 17 тыс.
50% 1

Опубликовано:

 

21 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии    
@AladdinPersson
@AladdinPersson 4 года назад
I recommend watching my explanation video before watching this: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-bQ7kRW6zo9Y.html @Theblackin Pearls noticed that there was an error in the code. It's fixed now in the code link in Github and it's not a major change (compare the code in the video with code currently on Github!). The error is in the function find_solution as I was calling OPT[:m][:n] like this as if it were a matrix but it's not as it's a list of lists which doesn't work the same as matrices. Instead just call it with the entire OPT and it should work fine.
@liamandrus4440
@liamandrus4440 2 года назад
this video came in CLURTCH for my project! god bless you sir
@Batool664
@Batool664 4 года назад
Literally the best teacher ever. Thank you so much
@Karim-nq1be
@Karim-nq1be Год назад
So many crappy explanations of this algorithm, but this one is extremely good, thank you.
@danielbell99
@danielbell99 3 года назад
Awesome tutorials! How can I asses it's algorithmic performance? Do you implement the Smith Waterman algorithm also? (Cool if not) Thanks :)
@iqraanam9226
@iqraanam9226 4 года назад
Could you please help me out for designing a program to get multiple alignments from 2 input sequences?
@bigpounds8835
@bigpounds8835 4 года назад
hello @Aladdin Persson when i run the code following same steps as you did i find an error that "i is not defined" can you please help me
@bigpounds8835
@bigpounds8835 4 года назад
thanks i found my error :)
@zhaoyu720
@zhaoyu720 3 года назад
good video,but still has two little issue .1.I spent half hour ,try to understand why the recurisive function need to return OPT[:][:], and then , I find it doesn't matter.....you just need to return OPT 2. in the recurisive function (selection) insert has a higher priority than others (align, delect)
@toufickfoury1164
@toufickfoury1164 4 года назад
hello! cool vid and nice explanation. I want to ask if it works for long sequences like those of length 10000 for example because it is giving me list index out of range for such long sequences
@AladdinPersson
@AladdinPersson 4 года назад
It should work for all sizes, could you provide your example and I could check if there's an error in the code?
@toufickfoury1164
@toufickfoury1164 4 года назад
@@AladdinPersson any 2 random sequences of length 1000 for example
@AladdinPersson
@AladdinPersson 4 года назад
Yeah you were right that there was an error in the code. In find_solution I was indexing in OPT as if it were a matrix (but it's a list of lists) causing indexing to be incorrect. Instead of doing OPT[:m][:n] which changes the OPT "matrix" incorrectly, instead just call the function with OPT. I pinned a comment that there's an error in the code displayed in the video. An updated code on Github is linked in the comment in the video, it's a minor change but makes a big difference. Thanks for commenting and noting this mistake
@toufickfoury1164
@toufickfoury1164 4 года назад
@@AladdinPersson no worries man great job! Is there any way I can contact you privately I have some cool idea in mind
@AladdinPersson
@AladdinPersson 4 года назад
You can email me at Aladdin.persson@hotmail.com
@kahkashanparveen1349
@kahkashanparveen1349 3 года назад
hat is the average score of the global alignment between 2 random DNA sequences of length 3? Use the following scoring scheme: a match is +1, mismatch is -1 and both opening and extension gap penalty is -0.5. Show your steps
@Hugo-ph5my
@Hugo-ph5my 4 года назад
Could you send a link to the code you wrote?
@AladdinPersson
@AladdinPersson 4 года назад
Yeah no problem: github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/dynamic_programming/sequence_alignment.py
@irvingrondon3718
@irvingrondon3718 4 года назад
Irving Rondon @Alladin Persson, So far python codes videos for the implementation of the Smith-Waterman Algorithm, Scoring Matrices, General gap Penalty, Dot Matrices will be very useful
@AladdinPersson
@AladdinPersson 4 года назад
Thanks for your comment, it was a while since I did this but if I get some spare time I'll try to look into this, are these different algorithms or variants of Sequence Alignment?
@shaheerullah3094
@shaheerullah3094 3 года назад
Make a vedio explaining globalxx and globalds when to use and why???? Usin python
@AladdinPersson
@AladdinPersson 3 года назад
What is that?
@shaheerullah3094
@shaheerullah3094 3 года назад
@@AladdinPersson this is used for sequence alignment (dna rna and protein) golbalxx is used for dna and mrna while globalds and other are used mainly for proteins. I got this explanation from various books but not quite sure.
@margaridaferreira8298
@margaridaferreira8298 3 года назад
TOP very usefull !
@lorinanela9955
@lorinanela9955 3 года назад
Ypur facebook acount or email i need your help for sm algorithme
Далее
Sequence Alignment | Needleman Wunsch Algorithm
18:29
Шок-контент! 😱
00:50
Просмотров 2,2 млн
What’s your height?🩷🙀💚
00:59
Просмотров 3,8 млн
5 Unique Python Projects (beginner to intermediate)
16:54
global sequence alignment
14:28
Просмотров 109 тыс.
how does python's module `__getattr__` actually work?
17:38
SHA: Secure Hashing Algorithm - Computerphile
10:21
Просмотров 1,2 млн
2. Local Alignment (BLAST) and Statistics
1:16:48
Просмотров 123 тыс.
2.2 Alignment dot plots
16:06
Просмотров 10 тыс.