Thesis Details

Možnosti využití sufixových stromů

Bachelor's Thesis Student: Chlubna Pavel Academic Year: 2019/2020 Supervisor: Burgetová Ivana, Ing., Ph.D.
English title
Suffix Trees Capabilities
Language
Czech
Abstract

This thesis discusses structure of suffix trees, their implementation and problematics, we can solved with suffix trees. The thesis also focuses on construction of suffix trees, with usage of Ukkonen's algorithm. Apart of implementation of this structure this thesis deals with comparing other commonly used algorithms with suffix trees in term of time complexity. A result of this thesis is application with graphical interface, that shows usage of suffix trees in solving various problematics and shows comparison of this structure to other algorithms.

Keywords

Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity

Department
Department of Information Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade B
Date
9 July 2020
Reviewer
Hynek Jiří, Ing., Ph.D.
Committee
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT), předseda
Burgetová Ivana, Ing., Ph.D. (DIFS FIT BUT), člen
Grézl František, Ing., Ph.D. (DCGM FIT BUT), člen
Smrčka Aleš, Ing., Ph.D. (DITS FIT BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Citation
CHLUBNA, Pavel. Možnosti využití sufixových stromů. Brno, 2020. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2020-07-09. Supervised by Burgetová Ivana. Available from: https://www.fit.vut.cz/study/thesis/23034/
BibTeX 
@bachelorsthesis{FITBT23034,
    author = "Pavel Chlubna",
    type = "Bachelor's thesis",
    title = "Mo\v{z}nosti vyu\v{z}it\'{i} sufixov\'{y}ch strom\r{u}",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2020,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/23034/"
}

Theses

Back to top