LEA
Department of Computer Science at the Technische Universität München
Chair for Efficient Algorithms
Postal address: 80290 München; Premises: Arcisstr.21, 80333 München
deutsch

Computational Biology (SS 02)


* Lecturer:
Prof. Dr. Ernst W. Mayr,
Dr. Volker Heun

* Area:
4 lectures per week
Bioinformatics: mandatory course (Bachelor/Diploma)
Computer Science: advanced course in area III (Theoretical Computer Science)

* Time and Place:
Tue 10h c.t. - 11:45, lecture hall 0220
Fri 10h c.t. - 11:45, lecture hall 0220

* Exercises:
2 hours per week exercises accompanying the lectures
Thu 12h c.t. - 13:45, lecture hall 1200
Teaching Assistant: Moritz Maaß
Course Certificate: To get a course certificate students must get at least 40% on the homework assignments and pass the final exam.

* Audience:
graduate students of computer science
students with computer science as minor

* Prerequisites:
1st and 2nd year courses

* Recommended for:
In-depth knowledge in topic Algorithms

* Contents:
  • Basic Concepts of Biology
  • Physical Mapping
  • Phylogenetic Trees
  • Hidden Markov Models

* Related and Advanced Lectures:

* Lecture Notes:
Lectore Notes of Part I and addenda are available.

* References:
P. Clote, R. Backofen:
Computational Molecular Biology - An Introduction
Wiley, 2000.
R. Durbin, S. Eddy, A. Krogh, G. Mitchinson:
Biological Sequence Analysis - Probabilistic Models of Proteins and Nucleic Acids
Cambridge University Press, 1998.
D. Gusfield:
Algorithms on Strings, Trees, and Sequences - Computer Science and Molecular Biology
Cambridge University Press, 1997.
D.W. Mount:
Bioinformatics - Sequence and Genome Analysis
Cold Spring Harbor Laboratory Press, 2001.
P.A. Pevzner:
Computational Molecular Biology - An Algorithmic Approach
MIT Press, 2000.
J. Setubal, J. Meidanis:
Introduction to Computational Molecular Biology
PWS, 1997.
M.S. Waterman:
Introduction to Computational Biology - Maps, Sequences and Genomes
Chapmann and Hall, 1995

* Office Hours:
look here


heun@in.tum.de