Genomics | String-searching algorithms

Please find bellow the links to the lecture slides.

• 1) Introduction

• 2) Naive approaches

• 3) Levenshtein Distance

• 4) Alignment

• 5) Burrows Wheeler Transform

• 5) DC3 Algorithm

Please find bellow some links to practical works on string search algorithms.

• 1) String Distance - Alignment: [Questions .ipynb] [Answers .ipynb] [Answers .html]

• 2) Burrows-Wheeler Transform: [Questions .ipynb] [Answer .ipynb] [Answer .html]

• 3) [Bonus] Robustness and Evolvability: [Questions .ipynb] [Answers .ipynb] [Answers .html]