Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

Advanced Algorithmization

The course is not on the list Without time-table
Code Completion Credits Range Language
01PALG KZ 2 1P+1C Czech
Garant předmětu:
Lecturer:
Tutor:
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:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-04-11
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet5357906.html