The Neighbour Joining algorithm for phylogenetic tree estimation
Вставка
- Опубліковано 5 вер 2024
- The neighbour joining algorithm is the most widely used distance-based tree estimation method in phylogenetics, but biology and bioinformatics students often find it mysterious. I discuss the basis of the neighbour joining algorithm and compare it to UPGMA, including a worked example from start to finish
extremely well made video, im taking a computational biology class and you made all these concepts such as 4 point condition, dissimilarirty matrix, and neighbor joining so much more clear, thank you so much!
You did so so well!! I was struggling with this topic till i landed on your video
Great great Videos! Thank you. Could you possibly make videos on Maximum likelihood, markov properties and how recombination and mutations are used in phylogenetics, please?
Great ideas!
Fantastic!
saved my life thank you 😍
AMAZINGGGGG Thank you so much!
Hi, first, thank you so much for explaining the NJ method (-: it's so helpful. Second, according to the formula you presented, the example of a divergence matrix is a bit wrongly calculated.
Who the hell are you…sir…what’s your qualifications
Welcome to the internet! You may have missed the part at 4:23, or you may have missed the links to my LinkedIn profile and Google Scholar profile, both available on the "about" section of this channel.