Acquiring knowledge about types and sources of data available for computational biology, and about mathematical methods and algorithms used for solving substantial informatical problems in molecular biology.

After the course, a student is capable of further studying and individual scientific work in bioinformatics.

- Basic concepts of molecular biology; - String comparison algorithms; - Phylogenetics trees; - Genome sequencing and assembly; - Mathematical apparatus as basis for string analysis; - Data mining in bioinformatics.

Solving practical problems in bioinformatics. Involving students in current research.

None.

Total assigned hours: 90

New material: 30
Elaboration and examples (recapitulation): 0

Auditory exercises: 45
Laboratory exercises: 0
Calculation tasks: 0
Seminar paper: 0
Project: 0
Consultations: 0
Discussion/workshop: 0
Research study work: 0

Review and grading of calculation tasks: 0
Review and grading of lab reports: 0
Review and grading of seminar papers: 0
Review and grading of the project: 0
Test: 0
Test: 10
Final exam: 5

Activity during lectures: 0
Test/test: 40
Laboratory practice: 0
Calculation tasks: 0
Seminar paper: 20
Project: 0
Final exam: 40
Requirement for taking the exam (required number of points): 0

Bioinformatics Algorithms: an Active Learning Approach. Pavel Pevzner, Phillip Compeau, 2014; (наставник може изабрати другу одговарајућу актуелну литературу)