Stringology

Lecturer:

Tutor:

Supervisor:

Department of Computer Science and Engineering

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:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Doctoral studies, daily studies (compulsory elective course)
• Doctoral studies, combined studies (compulsory elective course)
• Doctoral studies, structured daily studies (compulsory elective course)
• Doctoral studies, structured combined studies (compulsory elective course)