Algorithms for Sequence Analysis

After some questions about the suffix array related tasks in the current assignment, here are some comments:
Suffix arrays were briefly defined at the end of Tuesday's lecture. Look up the definition on the slides if you forgot it. You only need the definition and basic knowledge about comaprison-based sorting from and introductory algorithms class to solve the assignments.

On another note: Tomorrow is a holiday (May 1st) with no lecture and no tutorial. If you have questions about the assignment, please use the forum. Solutions of the last assignment will be presented in next week's tutorial.

Your presence in the lecture and in one of the tutorials is highly recommended. Formally, presence in the lectures cannot be required, but the subject-specific exam regulations in Bioinformatics actually formally require presence in the tutorials. As the precise regulations differ between study programs, will not enforce presence. However, we will make the implicit assumptioon that you have regularly attended the lecture and the tutorials when designing the final exam.

We also have preliminary dates for the written exam:

- Main exam: Monday 28.07., 09-12 (romm TBA)

- Re-exam: Monday 29.09., 09-12 (room TBA)