Postscript: Where to go next
Some suggestions of where the student can get more exposure to algorithms for bioinformatics and computational biology.
1 Helmi 20101min
Lecture 12: Expected longest common substring II
Completion of the analysis of the expected length of the longest common substring in two random strings
12 Tammi 20106min
Lecture 7: From alignment graphs to formal dynamic programming
In this class, we move from the visual alignment graph to a purely symbolic treatment of how to compute sequence similarity and optimal alignment using dynamic programming.
7 Tammi 20108min
