Exam slots:
Date/Time | Last Name | First name |
18.07 | 10:00-10:30 | Bi | Yalan |
18.07 | 10:30-11:00 | Heimann | Lennard |
18.07 | 11:00-11:30 | Maliyakal Sebastian | Sweta Rose |
18.07 | 11:30-12:00 | Riethmüller | Michael |
18.07 | 12:00-12:30 | ||
18.07 | 12:30-13:00 | Thothathri | Gokul |
18.07 | 14:00-14:30 | Bonyani | Nouroulhoda |
18.07 | 14:30-15:00 | Nirmal | |
18.07 | 15:00-15:30 | Bhaskaraiah | Hemakiran |
Ziele:
Die Studentinnen und Studenten erlangen ein tieferes Verständnis für grundlegende algorithmische Konzepte im Bereich der Analyse genomischer Sequenzen vor dem Hintergrund aktueller Forschungsrichtungen der Bioinformatik und Biotechnologie. Sie verstehen verschiedene Paradigmen zur approximativen Suche, sie wissen, unter welchen Voraussetzungen bestimmte Algorithmen anderen vorzuziehen sind, und können wissenschaftliche Publikationen auf dem Gebiet entsprechend einschätzen.
Contact:
* Prof. Dr. Knut Reinert - Knut.Reinert@fu-berlin.de
* Svenja Mehringer - svenja.mehringer@fu-berlin.de
Room and Times:
* Tuesdays: 8-12am, T9/046 seminar room (Takustr. 9)
* Thursdays: 12 - 2pm, T9/046 seminar room (Takustr. 9)
Requirements to pass this course:
- Seminar:
- Attend all seminars (absences need to be attested/agreed to by Svenja)
- Present at least once (with your group)
- Exercise:
- Hand in your solutions in the beginning of each exercise (with your group)
- Get 50% in all reviews
- Lecture: Oral exam (in the end)
Content
There are corresponding lecture videos from SS 2024, SS 2023 and SS 2022.
# | Date | Event | |
---|---|---|---|
1 | 16.04. | L: Suffix array search | |
2 | 16.04. | L: LCP computation | |
3 | 18.04. | L: Suffix array construction | |
4 | 23.04. | Exercise | |
5 | 23.04. | Exercise | |
6 | 25.04. | Exercise | |
7 | 30.04. | S: DisLex: a transformation for discontiguous suffix array construction (G1) | |
8 | 30.04. | Review 1 | |
9 | 02.05. | L: Onedirectional FM-indices | |
10 | 07.05. | L: Bidirectional FM-indices | |
11 | 07.05. | L: Extensions of FM-indices | |
12 | 09.05. | holiday | |
13 | 14.05. | Exercise | |
14 | 14.05. | Exercise | |
15 | 16.05 | S: FM-trees (G2) | |
16 | 21.05 | Review 2 | |
17 | 21.05. | L: k-mer based analysis I: Concentration bounds | |
18 | 23.05. | L: k-mer based analysis II: Estimate cardinalities and minimizers | |
19 | 28.05 | L: k-mer based analysis III: Storing sets of kmers | |
19 | 28.05. | Exercise | |
20 | 30.05. | Exercise | |
21 | 04.06. |
|
|
22 | 04.06. | L: k-mer based analysis V: Sketching and comparison of sets k-mers | |
23 | 06.06. | Exercise | |
24 | 11.06. | Exercise | |
25 | 11.06. | Exercise | |
26 | 13.06. | S: Strobemers: Effective sequence similarity detection ... (G3) | |
27 | 18.06. | L: Filter I | |
28 | 18.06. | L: Filter II | |
29 | 20.06. | Review 3 | |
30 | 25.06 | L: Filter III | |
31 | 25.06. | L: Filter IV: Verification: Myers Bitvector Algorithm | |
32 | 27.06. | Exercise | |
33 | 02.07. | Exercise | |
34 | 02.07. | Exercise | |
35 | 04.07. | S: Genmap (G4) | |
36 | 09.07. | S: Adaptive Seeds (G?) | |
37 | 09.07. | Review 4 | |
38 | 11.07. | Q&A | |
39 | 18.07. |
Exams |
Seminar
To pass the seminar, you need to attend all seminars (Please contact me, Svenja, if you cannot make it) and present at least once with your group. Please sign up for a group under Section Info. The seminars will be structured like a journal club. That means:
For the presenting group: Explain the main content of the paper with the help of the blackboard or an interactive Tablet session. You can prepare a few slides with selected figures from the paper or more complex examples but it is not supposed to be a typical full fledged presentation. You'll lead the discussion afterwards, meaning to answer questions from other students or asking questions to the others to open up a discussion: E.g. "What to you think about the quality of this paper?", "What was the main contribution of this paper to the research community?",...
For everyone: I expect EVERYONE to have read the paper! Otherwise the discussion is pointless. You do not need to understand every aspect but you should be able to give a short summary if I ask. Ideally, you would come with a list of questions and comments.
Exercise
Attendance is not mandatory but recommended. "Aktive Teilnahme" will be granted by reaching 50% of all points in the reviews. You can work in groups, but please write your names on top of your solution sheet. I expect everyone to bring their (groups) solutions with them to class. Either on paper or on a tablet/laptop that you are fine to pass around the class for the time of the exercise. We will try a peer review process, meaning that I will collect the solutions of everyone and hand them out randomly again. We will then go over the tasks one-by-one, comment the solutions and discuss questions or problems.
|