News
Questions from assignment 2 and 3Written on 16.11.25 (last change on 16.11.25) by Inês Ferreira Hi everyone, Regarding your questions about assignment 2 and assignment 3: For assignment 2, exercise 4, the exercise about placing objects into bins without collisions, a new version has been uploaded to the materials page. This updated version includes a correction on how to use the Poisson… Read more Hi everyone, Regarding your questions about assignment 2 and assignment 3: For assignment 2, exercise 4, the exercise about placing objects into bins without collisions, a new version has been uploaded to the materials page. This updated version includes a correction on how to use the Poisson approximation for this problem, and we have also added an alternative approach using Stirling’s approximation. Please take a look to see the differences and to understand when certain approximations can or cannot be used. For assignment 3, the solution to exercise 3 has been posted, including a detailed explanation of how to calculate the mismatch probability between the reads (p). Additionally, since there was a question about whether it was possible to use a Poisson distribution for exercise 4, we have posted a solution to exercise 4 showing both the standard approach and the Poisson-based approach. See you next week! |
Today's Tutorial - Room ChangeWritten on 12.11.25 by Inês Ferreira Hey everyone, Today, the room where we usually have our tutorial is occupied. The tutorial will take place in room 007 (same building, same floor). See you soon, Inês |
Assignment 02, Problem 4Written on 06.11.25 by Inês Ferreira Hi everyone, As discussed in this week's tutorials, there are two valid approaches to solving Problem 4 of Assignment 2. These approaches lead to slightly different numerical results, depending on the method you choose. Hi everyone, As discussed in this week's tutorials, there are two valid approaches to solving Problem 4 of Assignment 2. These approaches lead to slightly different numerical results, depending on the method you choose. Best, |
Submission of Assignment 2Written on 31.10.25 by Inês Ferreira Hi everyone, Assignment 2 submissions are now open (sorry for the delay!). I’ve extended the deadline until tomorrow night. Best, |
Clarification About Office HoursWritten on 30.10.25 by Inês Ferreira Hey everyone, a clarification about office hours: Office hours are available by request via email. They are mainly intended for personal concerns or, on rare occasions, to clarify concepts from lectures that you didn’t fully understand. If your questions are related to assignments, please attend… Read more Hey everyone, a clarification about office hours: Office hours are available by request via email. They are mainly intended for personal concerns or, on rare occasions, to clarify concepts from lectures that you didn’t fully understand. If your questions are related to assignments, please attend the tutorials instead. As a reminder: Best, Inês |
Extra Exercises and Tutorial TimesWritten on 29.10.25 (last change on 29.10.25) by Inês Ferreira Hey everyone, The extra exercises for this week have been posted on CMS. Regarding the exam: Calculators are not allowed. There will be an official cheat sheet that you can use. |
Extra ExercisesWritten on 25.10.25 by Inês Ferreira The extra exercises from last week have been posted on CMS. |
Assignment 02 onlineWritten on 25.10.25 by Sven Rahmann Assingment 02 is online with a few different exercises concerning combinatorics, approximations and discrete distributions, notably Poisson. |
Today's Tutorial CancelationWritten on 22.10.25 by Inês Ferreira Good morning everyone, Starting tomorrow, the tutorials will be held in room 0.01 (same room as the lectures). Unfortunately, since no room is available today, the tutorial is canceled. See you tomorrow, Inês |
Tutorial Schedule UpdateWritten on 20.10.25 by Inês Ferreira Dear all, Thank you for completing the poll regarding tutorial times. We have decided to offer two tutorial sessions each week: Wednesday, 14:00–16:00 See you soon, |
Materials and First AssignmentWritten on 17.10.25 by Sven Rahmann There are now lecture slides for this and next week among the materials, as well as the first assignment, which starts today and should be submitted by next Friday (24.10.). Have a nice weekend! |
Tutorial - PollWritten on 16.10.25 by Inês Ferreira Hi everyone, There is now a poll to find the best weekly tutorial slots. You can find the link under Materials. Please fill it out as soon so that we can set the tutorial date before next week. Thank you. |
BioStatsLab (a BSc Bioinformatics Replacement for MInf3)
Basic mandatory course, B.Sc. Bioinformatics, Saarland University.
This course is not available for credit points to students of other programs! You are welcome to audit, but will not get ECTS.
| Prerequisites | Mathematics (MInf1+Minf2, especially some analysis and linear algebra); solid programming skills |
| Credits | 9 ECTS credits |
| Required time | 4V+2Ü (4 hours of lectures, 2 hours of tutorials per week) |
| Language | English (although this is a basic course, it also serves as an additional prerequisite for international Master students, and is hence given in English!) |
| Registration | click on Registration in the menu header |
| Materials | Materials will be available after registration under Information > Materials |
| Times |
Lecture: Wednesday 08:30 - 10:00 and Friday 12:15 - 13:45. Tutorials: Wednesday, 14:00–16:00, Thursday, 08:00–10:00 Office Hour: TBA |
| Mode | lecture in presence in E2.1, room 001 |
| Link | https://cms.sic.saarland/biostatslab25 |
| Instructor | Prof. Dr. Sven Rahmann |
| Tutorials | M. Sc. Inês Alves Ferreira |
| Exam | Written exam (up to 3h) at the end of the semester. Requirements to participate in the exam: - No score requirements for the exercises (pointless since LLMs can solve all of these) - Presentation of your solved exercises before the tutorial group (as explained in the first lecture) |
Target audience
This course is offered as a basic lecture in the B.Sc. Bioinformatics program as a replacement for Mathematics for Informaticians 3 (MInf3).
Thus it should be taken in the 3rd semester, after completing MInf1 and MInf2, as well as Programming 1 & 2.
It should be taken in parallel to Bioinformatics 1 during the B.Sc. Bioinformatics program.
You will need some programming skills to qualify for the exam. Best would be Python, but you can use a language of your choice.
Please do not waste your time by attempting this course without a solid basis in programming.
Topics
The following topics will be covered in the course; additional topics may be included, depending on time and current events.
Probability
- randomness
- uniform distributions on finite sets (Laplace spaces)
- elementary and advanced combinatorics
- finite, discrete and continuous probability spaces
- random variables
- discrete probability distributions and how they are derived
- probability distributions and OOP, scipy.stats
- conditional probabilities
- Bayes’ Theorem, simple version
- moments of random variables (expectation, variance, …)
- continuous probability distributions
- a glimpse at measure theory
- posterior distributions
Statistics
- descriptive statistics
- parametric models
- statistical testing (frequentist view)
- statistical testing (Bayesian view)
- parameter estimation: moments, maximum likelihood
- parameter estimation in mixture models: EM algorithm
- regularization and Bayesian view on estimation
- linear regression
- robust regression
- multiple regression
- logistic regression
Stochastic Processes
- stochastic processes
- models for random sequences
- Markov chains
- Markov processes: models of sequence evolution
- Hidden Markov Models and applications
- Probabilistic Arthimetic Automata (PAAs) and applications
- the Poisson process
- distribution of DNA motif occurrences: compound Poisson
- significance of pairwise sequence alignment
Applications in Bioinformatics
- tests for differential gene expression
- Bayesian view on differential gene expression
- high-dimensionality low-sample problem
- multiple testing
Multi-dimensional analysis (compact, 1 week)
- partial / total differentiability
- high-dimensional optimization
