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. R. Durbin et al.: Biological sequence analysis
2. D. L. Wilson: Introduction to Biology
3. J. Felsenstein: Inferring Phylogenies
4. M. S. Waterman: Introduction to Computational Biology: Maps, Sequences and Genomes
5. W. J. Ewens, G. R. Grant: Statistical Methods in Bioinformatics

Enrollment :
Passed : Computer programming 1
Passed : Elementary mathematics 1
Passed : Linear algebra 1

Izborni modul Biologija - Regular study - Mathematics

Izborni modul Biologija - Regular study - Mathematics