Card-index course
Bioinformatics Algorithms - ED 24/Série 3
Responsible Faculty: Doctoral school (FBM-DOCT)
Teacher(s): Christophe Dessimoz, David Gfeller
Course Timetable (Aperiodic)
| Date | Location | Notice | Topics | Lecturer(s) |
|---|---|---|---|---|
| 04.03.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz | ||
| 11.03.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz | ||
| 18.03.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz | ||
| 25.03.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz | ||
| 01.04.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz | ||
| 15.04.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | David Gfeller | ||
| 22.04.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | David Gfeller | ||
| 29.04.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | David Gfeller | ||
| 06.05.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz | ||
| 20.05.2021 de 09:00 à 12:00 | Salle 336, Amphipôle, Quartier UNIL-Sorge | Christophe Dessimoz |
Course (optional)
Annual
Aperiodic
Teaching language(s): English
Public: Yes
Credits: 3.00
Objective
The course aims at improving the student's programming skills by gaining a deep understanding of some of the key algorithms in bioinformatics, with a special emphasis on sequence and graph algorithms. Students will learn widely applicable concepts, such as asymptotic time complexity, binary search, dynamic programming, hashing. Practicals and home assignments are essential parts of the course. The language of the course is Python, though the concepts covered in the course are applicable to all computer languages.
More info, including dates, rooms, and link to Moodle page:
https://lab.dessimoz.org/teaching/bioinfalgo/
Evaluation
Mandatory assessment: 20 min oral examination
Final test that will take place in summer exam session - date will be provided in due course
Programme requirements
The course assumes familiarity with basic programming concepts (variable and function declaration, arrays, for-loops, conditional statements, etc.). Algorithms are introduced from a practical angle so the mathematical formalism is kept at a minimum.
Grant requirements
Active participation certified by the teacher.
Access requirements
Registration via the Doctoral School. Series 3
