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 11b - Expected Length of the Longest Common Substring |
We discuss the expected length of the longest common substring (not subsequence) between two random strings of length n each, and show that it grows only logarithmically as a function of n - much slower than the growth of the expected longest common subsequence discussed in Lecture 11a.
Go to the Course Home or watch other lectures: