Algorithms for Sequence Analysis

IMPORTANT: Today is the last day to register or unregister for the exam in LSF. If you have not registered by today, you will not be able to write the exam. All problems registering should be reported to your exam office immediately. We cannot help with registration or do it for you, especially not after the deadline. Which is today.

So you may get an idea of possible exam questions, we have uploaded an old exam. Of course, this year's exam will be different. It is neither necessary nor sufficient to do this mock exam. It could still help to assess your own knowledge. You can find it in the Materials section, on top.

 

We uploaded a small SAIS task in the material section.

In addition, we have created a small web app you can use to prepare for the exam. You can find it here:
https://gitlab.com/rahmannlab/alsa-app

The link is also in the material section.

It covers a large part of the topics and allows you to work on the topics with different inputs and compare them with a solution.

Dear all, 

assignment 12 (due today) is the last regular assignment and the correct total number of points is now entered in the CMS.
To be admitted to the exam, you need 50% of the theory and programming points. Please check your personal status page to see whether you still need points.

If you still need points, you have the opportunity to do assignment 13, which contains bonus theory and programming tasks.

Dear all,

since last week, the evaluation links for the lecture have been posted in the Materials section (very much on top of the page). Unfortunately, evaluation is only open till tomorrow (Sunday), so please provide your comments ideally today. The links will take you to the university evaluation system, where your vote will be anonymous to the lecture team.

While the numerical scores are important as well, it helps us even more if you can write a few bullet points of free text about what you liked and what not. Thank you.

Please note that there are separate evaluations (and links) for the lecture itself and the tutorial

Dear all,

the lecture period progresses fast and I would like to remind you that you have to present 2 tasks in the tutorial.
This is (in addition to obtaining 50% of theory and programming points) required to qualify for the final exam.

You can check how often you have presented in you personal status page of the course.

Best,
Jens

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)