Several complex problems arising from biology and computer science (e.g., sequence alignment, gene finding, inference for population sequence data) can not be solved at the same time efficiently and optimally by using deterministic methods. In such cases, stochastic methods are used to advantage. Building on the foundations of probability theory and statistics, this course lays the basis for stochastic computing (i.e., representation of distributions in the computer, computations with small probabilities, efficient generation of random numbers with given distribution, test of the quality of random number generators). As an important tool, the Markov chain Monte Carlo (MCMC) methods are presented via examples (Metropolis-Hastings, Gibbs sampling). Importance sampling methods and simulation of rare events are as well presented.
Frequency | Weekday | Time | Format / Place | Period |
---|
Module | Course | Requirements | |
---|---|---|---|
39-Inf-ASB Algorithmische Stochastik in der (Bio-)Informatik | Algorithmische Stochastik in der Bioinformatik | Ungraded examination
Graded examination |
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.
A corresponding course offer for this course already exists in the e-learning system. Teaching staff can store materials relating to teaching courses there: