Discrete Computational Biology

Wintersemester 2011/12





Lecturer:
Tutor:
Aims:
  • Starting with an introduction into basic discrete mathematics, in particular graphtheory,
    we will turn on to explore their application in biology.
    The lecture will include topics like: RNA (e.g. folding, combinatorial problems),
    phylogentics, phenotypespaces (graphproducts ).
    The special lecture should prepare students for master and Ph.D. theses at the interface
    between biological problems, bioinformatics and discrete mathematics.

Previous knowledge:
  • Familiarity with discrete mathematics, bioinformatics 1 and 2, basics of programming, and algorithms.

Certificate requirements
  • >= 50 percent correctly solved problems in the exercises ((2-)weekly)
  • Pass exam

Start Lecture:
  • Wednesday, October 19, 2011 // 2pm // E2.1 Room 007

Start Tutorial::
  • Monday, November 7, 2011 // 12 pm - 2pm // Building E2.1 Room 001

Registration for this course and the exam:
  • Register for course: manually during the first lecture.
  • Register for exam: register here

recommended literature:
  • Introduction to Computational Biology: Maps, Sequences and Genomes
    Michael S. Waterman
  • Understanding Bioinformatics
    Marketa J. Zvelebil
  • Phylogenetics
    Charles Semple and Mike Steel


additional literature:
  • Handbook of Product Graphs, Second Edition (Discrete Mathematics and Its Applications)
    Richard Hammack, Wilfried Imrich and Sandi Klavzar