Lectures Efficient Algorithms and
Data Structures II Computational Biology I External Memory Algorithms Pearls of Computer Science IV Python for Fine Programmers Proseminar Algorithms for daily life Lab Course Discrete Optimization Courses for PhD Students Oberseminar

Computational Biology I

• Lecturer:
  Dr. Hanjo Täubig
• Module: IN2179
• Area:
  4+2 lectures per week in area III (Theoretical Computer Science)
  advanced course, topic algorithms
• Time and Location:
  Tuesday, 15:15-16:45, MI Hs 2
  Friday, 13:15-14:45, MI Hs 3
• Exercises:
  2 hours per week exercises accompanying the lectures
  (time: Friday, 15:15-16:45), Room MI 03.11.018,
  Teaching Assistant: Johannes Krugel
• Course Certificate:
  To get a course certificate students must pass the final exam.
• Audience:
  graduate students of computer science
  students with computer science as minor
• ECTS: 8 points
• Prerequisites:
  1st and 2nd year courses
  Course Efficient Algorithms and Datastructures I advantagious, but not necessary.
• Recommended for:
  In-depth knowledge in topic Algorithms
• Contents:
  
  1. Molecular biology fundamentals
  2. Text Searching Algorithms
  3. Pairwise sequence alignment
  4. Multiple sequence aligment
  5. Fragment assembly
• Related and Advanced Lectures:
  Computational Biology II
• Slides:
  
• Lecture Notes:
  See the German webpage (click on the German flag).
• References:
  
  • P. Clote, R. Backofen:
    Computational Molecular Biology - An Introduction,
    John Wiley & Sons, 2000.

  • N. C. Jones, P. A. Pevzner:
    An Introduction to Bioinformatics Algorithms,
    MIT Press, 2004.

  • P. A. Pevzner:
    Computational Molecular Biology - An Algorithmic Approach,
    MIT Press, 2000.

  • J. Setubal, J. Meidanis:
    Introduction to Computational Molecular Biology,
    Brooks/Cole Publishing Company, 1997.

  • M. S. Waterman:
    Introduction to Computational Biology - Maps, Sequences and Genomes,
    Chapman & Hall/CRC, 2000.

• Office Hours:
  look here