Algorithmic Bioinformatics
Lecturer: Prof. Michael Schroeder (ms at biotec)
Tutor: Frank Dressel (frank.dressel at biotec)
Slides
Tutorial Notes
During the lab sessions we will provide you exercises for the bioinformatics algorithms discussed during the lectures. Your goal will be to design strategies and solutions for the proposed tasks with paper and pencil. You might also write sometimes python code to solve the exercises. In some cases we will also provide you template programme files which you should understand and eventually modify. You will get explanations for both the paper & pencil exercises and programmes. All the lab sheets and the corresponding solutions can be downloaded from this webpage.
Material for the lab
- Lab1: Simple dynamic programming
- Lab2: Blast (updated)
- Lab3: Blast II
- Lab4: Aligning AFM-curves and coin changing (updated)
- Lab5: Dynamic programming, LCS
- Lab6: A*
- Lab7: A* and progressive alignment
- Lab8: Clustering and trees
- Lab9: Neighbor joining and RMSD
- Lab 10: Prepare questions!
Solutions for the lab
- Lab1: Solution (updated)
- Lab2: Solution (updated)
- Lab3: Solution
- Lab4: Solution, greedy
- Lab4: Solution, recursive
- Lab4: Solution, dynamic programming
- Lab5: Solution, dynamic programming
- Lab6: A*, Step 1, Step 2, Step 3, Step 4, Step 5, Step 6, Step 7
- Lab7: Solution, MSA
- Lab8: Solution, Clustering tree
- Lab9: Solution, Neighbor joining (update)
will be added after each lab.
