The efficiency of bioinformatics software is intrasically related to the data structures they use. In addition to enabling the data storage, data structures present some specificities, making each of them more suited to run specific analyses than the others. An example would be a sequence aligner which will favor a data structure very time efficient for locating occurences of a subsequence in a dataset, instead of good index compression ratio.
In this seminar, students will have to read articles about bioinformatics software and give a talk about it.
During the talk, the student should present the software with a main focus on the data data structure used, explain the workflow of it and how the software exploits the specificities of the data structure.
Frequency | Weekday | Time | Format / Place | Period | |
---|---|---|---|---|---|
weekly | Di | 16-18 | U10-146 | 06.10.2014-06.02.2015 |
Module | Course | Requirements | |
---|---|---|---|
39-Inf-AB Algorithmen der Bioinformatik | Algorithmische Implementierung | Study requirement
|
Student information |
Ausgewähltes Seminar zu Algorithmen der Bioinformatik | Study requirement
|
Student information | |
39-Inf-SAB Spezielle Algorithmen der Bioinformatik | Algorithmische Implementierung | Study requirement
|
Student information |
Ausgewähltes Seminar zu Spezielle Algorithmen der Bioinformatik | Student information |
The binding module descriptions contain further information, including specifications on the "types of assignments" students need to complete. In cases where a module description mentions more than one kind of assignment, the respective member of the teaching staff will decide which task(s) they assign the students.
Degree programme/academic programme | Validity | Variant | Subdivision | Status | Semester | LP | |
---|---|---|---|---|---|---|---|
Bioinformatik und Genomforschung / Bachelor | (Enrollment until SoSe 2011) | Spezielle Algorithmen; Angewandte Algorithmik | Pflicht | 4. | 4 | benotet | |
Informatik / Bachelor | (Enrollment until SoSe 2011) | Nebenfach | Angewandte Algorithmik | Wahlpflicht | 6. | 4 | scheinfähig benotet/unbenotet |
Naturwissenschaftliche Informatik / Bachelor | (Enrollment until SoSe 2011) | Angewandte Algorithmik | Wahlpflicht | 6. | 4 | benotet | |
Naturwissenschaftliche Informatik / Diplom | (Enrollment until SoSe 2004) | allgem.HS | HS | ||||
Naturwissenschaftliche Informatik / Master | (Enrollment until SoSe 2012) | Angewandte Algorithmik | Wahlpflicht | 2. | 4 | benotet | |
Studieren ab 50 |