Advanced Algorithmization
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
01PALG | KZ | 2 | 1P+1C | Czech |
- Course guarantor:
- Tomáš Oberhuber
- Lecturer:
- Tutor:
- Tomáš Oberhuber
- Supervisor:
- Department of Mathematics
- Synopsis:
-
Keywords:
String algorithms, graph algorithms, dynamic programming, suffix tress, graph cuts, numerical methods for solution of partial differential equations.
- Requirements:
- Syllabus of lectures:
-
1. Pancake sort
2. Turnpike problem
3. String algorithms - motives finding, strings alignment, suffix trees
4. Graph algorithms in image processing - graph cuts
5. Graph algorithms for solution of PDEs - methods for solution of the Hamilton-Jacobi equation
- Syllabus of tutorials:
- Study Objective:
-
Knowledge:
Pancake sort, Turnpike problem, motives finding, dynamic programming for string comparison, suffix trees for searching of sub-strings, graph algorithms in image processing, graph algorithms and numerical methods for solution of the Hamilton-Jacobi equation.
Skills:
Students will learn new techniques for design of algorithms and how to apply knowledge from the graph theory and numerical mathematics for a construction of particular algorithms.
- Study materials:
-
Compulsory literature:
[1] R. Sedgewick, Algorithms in C++: Graph algorithms, 2002, Addison-Wesley.
[2] N. C. Jones, P. A. Pevzner, An introduction to bioinformatics, MIT Press, 2004.
Optional literature:
[3] W.-K. Sung, Algorithms in bioinformatics - a practical introduction, CRC Press, 2010.
- Note:
- Time-table for winter semester 2024/2025:
-
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Wed Thu Fri - Time-table for summer semester 2024/2025:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- Matematické inženýrství (compulsory elective course)
- Matematická informatika (elective course)