This lecture deals with: Exact and approximative string matching, dynamic programming and scoring schemata, finite automata and formal languages, pairwise und multiple alignment, multiple string matching, basics of Markov Chains und Hidden Markov Models, algorithms for fast search in sequence data bases.

In the exercises the above topics will be deepened, and techniques of analysis and evidence will be practised.

There is an associated practical course "Algorithmen und Datenstrukturen" (19401330). Please check there for further information!

Generelle Bücher/Basic reading:

• Neil C. Jones, Pavel A. Pevzner: An Introduction to Bioinformatics Algorithms. MIT Press, Cambridge, MA, 2004. ISBN 0-262-10106-8
• R. Durbin, S. Eddy, A. Krogh, G. Mitchison: Biological sequence analysis. Cambridge University Press, 1998. ISBN 0-521-62971-3
• David B. Mount: Bioinformatics. Sequence and Genome Analysis. Cold Spring Harbor Laboratory Press, New York, 2001. ISBN 0-87969-608-7
• Chao, Zhang: Sequence comparison, Theory and Methods: Springer, ISBN: 978-1-85800-319-4