1. komponenta

Lecture type	Total
Lectures	45
Exercises	15

* Load is given in academic hour (1 academic hour = 45 minutes)

COURSE AIMS AND OBJECTIVES:
The goal of the course is to introduce the most important techniques of the combinatorial and probabilistic of biological sequences - modelling of biological families, philogenetic constructions, gene searching. The emphasis is on applications - algorithmic, computational and numeric.

COURSE DESCRIPTION AND SYLLABUS:
1. Introduction. Biological processes, biomolecules - DNA, RNA, proteins, protein networks and aligning of sequence pairs, supstitution matrics, algorithms for aligning of sequence pairs
2. Markov chains, hidden markov models, Viterbi alghoritm and variants, family profile, gene searching.
3. Baurn - Welch optimization, introduction to philogenetic trees, neighbor - joining alghoritm.

1. Biological sequence analysis, R. Durbin et al., CUP, 2001.
2. Introduction to Biology, D. L. Wilson, Blackwell Science, 2000.
3. Inferring Phylogenies, J. Felsenstein, Sinauer, 2004.
4. Introduction to Computational Biology: Maps, Sequences and Genomes, M. S. Waterman, Chapman & Hall, 1995.
5. Statistical Methods in Bioinformatics, W. J. Ewens, G. R. Grant, Springer Verlag, 2001.

Izborni predmet 2 - Regular study - Mathematics Education