||Algorithms for exact string matching
Lecture 1. Inroduction to string matching. Z algorithm. KMP. Boyer-Moore.
||Lecture 2. Karp-Rabin. Aho-Corasick. Other related algorithms.||HW1
Suffix tree. Constant-time LCA.
||Lecture 4. Suffix array. Applications of suffix trees and suffix arrays.||HW2
||Extensions to basic string matching
Lecture 5. Sequences with dynamic programming. The four-Russians trick. Approximate string matching.
More Approximate string matching. Blast,
hashing and seeding.
||Lecture 7: Probabilistic models of strings and patterns.|
||Lecture 8: BWT.
||Applications and properties of string
Lecture 9: algorithms on text coding and compression
||Lecture 10: applications in high-throughput sequencing.||HW4|
||No class (due to travel)|
||Lecture 11: more recent topics on string algorithms.|
Student paper presentation 1.
||Project report due.|