Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Stringology

The course is not on the list Without time-table
Code Completion Credits Range
XP36STR ZK 4 2P+2S
Lecturer:
Tutor:
Supervisor:
Department of Computer Science
Synopsis:

Processing of strings and sequences. General, ordered alphabet. Generalized and weighted strings. Finite and infinite alphabet. Searching in text, dictionaries and languages. Exact and approximate matching. Forward and backward matching. Searching in compressed text. Searching in more-dimensional text. Searching for longest common factors and subsequences. Searching for regularities in text. Construction of covering of text. Representation of text, prefix, suffix and factor automata, suffix trees and arrays.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:
Study materials:

M. Crochemore, W. Rytter: Jewels of Stringology. World Scientific Publishing, 2002.

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 2019-10-18
For updated information see http://bilakniha.cvut.cz/en/predmet11908004.html