|
|
|
||
Last update: T_KSVI (23.05.2006)
|
|
||
Last update: doc. RNDr. Tomáš Dvořák, CSc. (13.10.2017)
The course is concluded with an oral exam. Questions posed in the exam explore the topics included in the syllabus to the extent that these topics are covered in lectures. |
|
||
Last update: doc. RNDr. Tomáš Dvořák, CSc. (03.10.2022)
M. Crochemore, C. Hancart, T. Lecroq, Algorithms on Strings, Cambridge University Press, 2014. M. Crochemore, T. Lecroq, W. Rytter, 125 Problems in Text Algorithms, Cambridge University Press, 2021. G. Navarro, M. Raffinot, Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences, Cambridge University Press, 2007. W. Smyth, Computing Patterns in Strings, Addison Wesley, 2003. |
|
||
Last update: doc. RNDr. Tomáš Dvořák, CSc. (13.10.2017)
Introduction to string algorithms Data structures: suffix tree and its variants, suffix array, suffix automata Exact and approximate pattern matching String distance and the longest common subsequence Regular expression matching Applications in bioinformatics and data compression |
|
||
Last update: T_KSVI (04.05.2015)
Knowledge at the level of the subjects Algorithms and Data Structures I and II, Automata and Grammars. |