Advanced Algorithmization

Garant předmětu:

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 2023/2024:

Time-table is not available yet

Time-table for summer semester 2023/2024:

Time-table is not available yet

The course is a part of the following study plans:

• Matematické inženýrství (elective course)
• Matematické inženýrství (compulsory elective course)
• Matematická informatika (elective course)