|
Lecturer(s)
|
-
Kopečný David, Mgr.
-
Kühr Tomáš, Mgr. Ph.D.
-
Krupka Michal, doc. RNDr. Ph.D.
-
Osička Petr, Mgr. Ph.D.
-
Kopečný David, Mgr. Ph.D.
|
|
Course content
|
Significant algorithmic problems and methods of their solutions and their applications. Will be studied such as the traveling salesman problem, linear programming, finding the Voronoi diagram and algorithms for strings and their applications in bioinformatics, such as comparing strings, the longest common substring, the shortest nadřetezec, search. Presentation and their solutions before other students, discussion.
|
|
Learning activities and teaching methods
|
|
Demonstration
|
|
Learning outcomes
|
The students become familiar with selected concepts of seminar for bioinformatics.
1. Knowledge significant problems and algorithms for their solution, the ability of applications to similar problems.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Written exam, Student performance
Active participation in class. Completion of assigned homeworks. Passing the written exam.
|
|
Recommended literature
|
-
A. M. Lesk. (2002). Introduction to Bioinformatics. University of Cambridge.
-
CORMEN, T. H., LEISERSON C. E., RIVEST D. L., STEIN C. (2001). Introduction to Algorithms, Second Edition. MIT Press.
-
Keith J.M., Totowa, N. J. (2008). Bioinformatics. Volume I, Data, sequence analysis and evolution.. Humana Press.
-
KNUTH, D. (1998). The Art of Computer Programming, Volumes 1-3. Addison-Wesley.
-
SKIENA, S. S. (2008). The Algorithm Design Manual, Second Edition. Springer.
|