Vorlesung RNA Bioinformatik
Lecturer
Mathias Möhl / Rolf Backofen
Daniel Maticzka (practice class)
Dates
-
Lecture: weekly, Tue, 10-12 in SR00 007 (MMR), Building 106
-
Exercise: weekly, Thu, 14-16 in SR00 007 (MMR), Building 106
Topics and Goals
In this lecture, you will learn about fundamental algorithms and
methods for the sequence and structure analysis of the biological
macromolecule RNA. We start by discuss algorithms for predicting
the RNA secondary structure (aka RNA folding) by maximizing base
pairs and by minimizing energy. Then, we study the probabilistic
analysis of structure by partition function approaches, which
allow computing base pair probabilities. Furthermore, we look in
depth at the comparison of RNAs by their sequence and structure,
where we discuss the alignment of folded RNA as well as
simultaneous alignment and folding. As special topics, we discuss
RNA-RNA-interaction, as well as the algorithmic treatment of
pseudoknots.
Required Skills
- Basic knowledge of bioinformatics as learned in courses
Bioinformatics I+II
- Fundamental knowledge in algorithms
- Programming skills in C++/Java
Exercises
can be found on this page.
Slides
- Introduction (pdf)
-
Structure prediction:
-
Comparative RNA analysis:
-
Overview of RNA related tasks and algorithms
