|12.08.2009||Instructions for preparing project report are out, via an e-mail. Project report are due by Tuesday, September 1st.|
Wednesday, 16:00 - 18:00, Campus E1.3, Room HS 03
First lecture will be held on April 22nd, 2009
|Tutorial|| We will have one tutorial session after each project milestone:
Elena Zotenko: after the lecture or by appointment
Sarah Diehl: Wed. 14:00-16:00; room 524; building E1 4 (MPI)
July 29, 13:00 - 18:00, 5th floor rotunda, MPII building.
The objective of the class is to introduce some beautiful algorithmic ideas that can be used in the analysis of Networks in general and Biological Networks in particular. The emphasis of the class is more algorithmic than biological. We will look into very different areas of Algorithmic Graph Theory/Discrete Mathematics such as: Mathematical Programming, Heuristic Design Techniques, Spectral Graph Theory, and Random Graphs. Needless to say, we won't be able to cover each area thoroughly; instead we will study one or two easy-to-understand algorithms that will give you the taste of possibilities.
Students are expected to have basic knowledge of Linear Algebra, Graph Theory and Python programming.
Your grade will be based on final exam (60%) and semester long project (40%). We will also have quizzes, short tests at the beginning of every other lecture. You are required to pass three out of six quizzes to be allowed to take the exam.
You will find slides and pointers to relevant papers here.
You will find project description and other project related materials here.