In this lecture we will introduce concepts and methods of advanced algorithmics relevant to current research in bioinformatics. We will discuss Methods for the development and analysis of deterministic and randomized algorithms and foundations of compact data structures. Finally, the lecture will encompass concepts for parallel and vectorized computing. In more detail we will cover:

- Introduction into different kinds of algorithms and analysis methods
- Foundations of compact data structures 
- Graph theory and graph algorithms 
- Analysis of randomized algorithms and data structures
- Introduction into parallel and vectorized computing
- Concepts, paradigms and frameworks for distributed computing

You find videos and slides from last year and this year following the links.

Date   Topic
17.10.   L: Types of algorithms and their analysis I
24.10.  L: Types of algorithms and their analysis II
31.10.  L: Compact data structures: Entropy and Coding
07.11.  L: Compact data structures: Arrays 
14.11.  L: Compact data structures: Bitvectors with rank and select I
21.11.  L: Compact data structures: Bitvectors with rank and select II 
28.11.  Review I
05.12.  L: Hashing I
12.12.  L: Hashing II
19.12.  L: Graph algorithms : Shortest path
09.01.  L: Graph algorithms : Network flow
16.01.  L: Graph algorithms : Bipartite Matching
23.01  L: Vectorized and parallel computing I
30.01.  Review II
06.02.  Rehearsal
13.02.  Examination

 

 

 

 

 

 

 

 

 

 

 

 

General notes for passing:

  •  Aktive Teilnahme (active participation)
    • Present one task of an assignment (~5min)
    • Hand in n-1 of the assignments (one hand-in per group)
    • Pass reviews with overall 50% of the points
  • Pass the exam
    • Only the exam will decide on your final grade

Contact:

Simon Gottlieb: s.gottlieb@fu-berlin.de or in my office T9/Room 010