ADS1: Approximate matching, Hamming and edit distance
We discuss why approximate matching is more appropriate than exact matching for the read alignment problem. We also discuss two kinds of distance we can use to measure how similar two strings are. Course page: https://www.coursera.org/course/ads1.