
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
15 years ago00:00/00:00Lecture 2: Further introduction
15 years ago00:00/00:00Lecture 3: Defining sequence similarity
15 years ago00:00/00:00Lecture 4: Extending the model of sequence similarity
15 years ago00:00/00:00Lecture 5: Computing sequence similarity
15 years ago00:00/00:00Lecture 6: Computing similarity using an alignment graph
15 years ago00:00/00:00Lecture 7: From alignment graphs to formal dynamic programming
15 years ago00:00/00:00Lecture 8: Sequence alignment using dynamic programming — continued
15 years ago00:00/00:00Lecture 9: Local sequence alignment
15 years ago00:00/00:00Lecture 10: End-gap-free alignment and whole-genome shotgun sequencing
15 years ago00:00/00:00