Algorithmic Bioinformatics

V+Ü Discrete Mathematics for Bioinformatics (P1)

(19255)

Aktuelle News!!

Type

Vorlesung + Übung

Instructor

Knut Reinert, Prof. Dr. Alexander Bockmayr, Sandro Andreotti

Credit Points

4 + 4

Time

Lectures:

Tue

10-12

Takustr. 9

SR 006

 

Thu

10-12

Takustr. 9

SR 006

Exercises:

Fri

10-12

Arnimallee 6  

SR 032

 

Student Profile

MSc students of Bioinformatics: In the new "Studienordnung": Pflichtmodul P1. In the old "Studienordnung": Can be used for areas C and D.

 

Slides & Scripts

  1. Linear Optimization (Bockmayr)
    linopt.pdf (389 KB) (updated October 20)
     
  2. Integer Linear Optimization (Reinert)
    [/file]combopt.pdf[/file] (updated November 9) [/file]mtLARA.pdf[/file]
     
  3. Finite Domain Constraint Programming (Bockmayr)
    [/file]constprog.pdf[/file] (updated December 11)
     
  4. Graph algorithms (Bockmayr)
     
  5. Network Flow (Bockmayr)
    [/file]network-flow_script.pdf[/file] (updated December 14)
     
  6. Hashing (Reinert)
    [/file]hashing_script.pdf[/file] (updated December 21)
     
  7. Skiplists (Reinert)
    [/file]skiplist_script.pdf[/file] (updated January 9)
     
  8. Tree decomposition (Reinert)
    [/file]script_treedecomposition.pdf[/file] (updated January 25)
     
  9. Computability and Complexity Theory (Bockmayr)
    [/file]complex.pdf[/file] (updated February 20)

Exercises

Each week the students have to work through their assignments. It is not necessary to hand in the solutions. However, we strongly encourage to solve the problems for yourself. The week after the assignments the solutions are discussed in the exercises.

 

 

 Exercises_1.pdf  -- [until October 24]
(linear programming basics)

 Exercises_2.pdf  -- [until October 31]

Reviews

There will be two reviews to check whether you worked through the exercise assignments. Students have to pass those reviews in order to have their "aktive Teilnahme" confirmed!