Algorithms for Sequence Analysis

Algorithms for Sequence Analysis - Tobias Marschall & Marcel Schulz

General info

  • Spezialvorlesung (2+1) with exercises
  • Lecture time: Wednesday 12:15-13:45, room 007, Campus E2 1
  • Exercise: Thursdays 14:15-15:45, room 001, Campus E1.7, room 001, 14:15-15:45pm. Note that the exercise is only on the following Thursdays: 24.4, 8.5., 22.5, 5.6., 26.6. 3.7., 17.7.
  • Master students are eligible
  • Registration: Please register at the course mailing list if you are interested to join the course: register here

Course overview

Sequence information is ubiquitous in many application domains. Handling the large amounts of sequence data produced by todays DNA sequencing machines is particularly challenging. This lecture addresses classic as well as recent advanced algorithms for the analysis of large sequence databases. Topics include: full text search without index, approximate pattern matching, index structures such as suffix trees and suffix arrays, Burrows-Wheeler transform and the FM index. These algorithms are introduced in the context of modern software packages routinely employed for analysis of large DNA sequencing datasets.

Course material

Course material will be available here: password protected area.