ECS 124: Fundamental Algorithms in Bioinformatics
ECS 124: Fundamental Algorithms in Bioinformatics (UC Davis). Instructor: Professor Dan Gusfield. This course covers fundamental algorithms for efficient analysis of biological sequences and
for building evolutionary trees. This is an undergraduate course taught by UC Davis computer science professor Dan Gusfield focusing on the ideas and concepts behind the most central algorithms in
biological sequence analysis. Dynamic Programming, Alignment, Hidden Markov Models, Statistical Analysis are emphasized.
The videos were mostly made in 2002 and edited and somewhat extended in 2014. Despite their age, and despite the fact that "software, databases, websites, and data" in bioinformatics change rapidly,
the topics included are still of current importance.
Lecture 29 - Additive Trees and the Neighbor-Joining Algorithm |
Additive trees and their construction. The Neighbor-Joining algorithm and its use with near-additive data. Bootstrap values and their misuse.
Go to the Course Home or watch other lectures: