ECS 124 - Foundations of Algorithms for Bioinformatics - Dan Gusfield

  • This page links to the videos of course lectures. These 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. This is because the emphasis in the lectures is on fundamental algorithms and analyses which already stood the test of time in 2002, and have continued to do so. Of course, there are some new topics in bioinformatics algorithms that were not of perceived importance in 2002, and hence are not covered by these lectures, but they are surprisingly few. An overview of each of the lectures Topics by date

    Lecture Videos

  • Lecture 1 Introduction to the course and to bioinformatics.

  • Lecture 2 Further introduction to bioinformatics, and the value of computing.

  • Lecture 3 How to define sequence similarity.

  • Lecture 4 Extensions to the model of sequence similarity

  • Lecture 5 Computing sequence similarity.

  • Lecture 6 Computing sequence similarity using an alignment graph.

  • Lecture 7 From alignment graphs to formal Dynamic Programming.

  • Lecture 8 Sequence alignment using Dynamic Programming - continued.

  • Lecture 9 Local sequence alignment.

  • Lecture 10 End-gap-free alignment and whole-genome shotgun sequencing.

  • Lecture 11 Expected lengths of the longest common subsequence and substring.

  • Lecture 11 Expected length of the longest common subsequence.

  • Lecture 11 Expected length of the longest common substring.

  • Lecture 12 Expected length of the longest common substring II.

  • Lecture 13

  • Lecture 14

  • Lecture 15

  • Lecture 16

  • Lecture 17

  • Lecture 18

  • Lecture 19

  • Lecture 20

  • Lecture 21

  • Lecture 22

  • Lecture 23

  • Lecture 24

  • Lecture 25

  • Lecture 26

  • Lecture 27

  • Lecture 28

  • Lecture 29

  • Lecture 30

  • Postscript