We discuss the Boyer-Moore algorithm and how it uses information about characters observed in one alignment to skip future alignments. Course page: https://www.coursera.org/course/ads1.
ADS1: Boyer-Moore basics
ADS1: Genome indexes used in research
BFS and DFS in a Binary Tree
Knuth–Morris–Pratt algorithm
Kruskal: Informatik (deutsch)
Gary King, "Why Propensity Scores Should Not Be Used for Matching"
Bellman-Ford in 5 minutes — Step by step example
ADS1: Sequencing by Synthesis
