Fundamental Algorithms in Bioinformatics
by Dan Gusfield
February 1, 2010 7:00 pm
This course covers fundamental algorithms for efficient analysis of biological sequences and for building evolutionary trees. This is an undergraduate course 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.
Recent Episodes
Lecture 1: Introduction to bioinformatics and the course
16 years agoLecture 2: Further introduction
16 years agoLecture 3: Defining sequence similarity
16 years agoLecture 4: Extending the model of sequence similarity
16 years agoLecture 5: Computing sequence similarity
16 years agoLecture 6: Computing similarity using an alignment graph
16 years agoLecture 7: From alignment graphs to formal dynamic programming
16 years agoLecture 8: Sequence alignment using dynamic programming — continued
16 years agoLecture 9: Local sequence alignment
16 years agoLecture 10: End-gap-free alignment and whole-genome shotgun sequencing
16 years ago