|
|
Visualisation of algorithms
Bašista, Peter ; Mareš, Martin (advisor) ; Valla, Tomáš (referee)
The goal of this work is to design a computer program for visualisation of algorithms and their execution in a classroom. The user writes the algorithm and attaches the prepared visualisation components to its data structures. The program will then record the progress of the computation and displays it as an interactive animation, alternatively it creates a PDF document with the key moments of the animation. In the presented work we introduce the Algorithm Animation Library. This library has been designed to be as flexible as possible, and at the same time as easy and friendly to use as possible. We present our approach towards animation of algorithms, briefly compare the developed library with the alternatives and conclude on when it is convenient to use the Algorithm Animation Library.
|
|
|
Suffix tree construction with minimized branching
Bašista, Peter ; Dvořák, Tomáš (advisor) ; Kadlec, Rudolf (referee)
Suffix tree is a data structure which enables the performing of fast search-like operations on the text. In order to be used efficiently, it must be created quickly. In this thesis, we focus on the new kind of suffix link simulation called "minimized branching", which aims to increase the speed of suffix tree construction by reducing the number of branching operations. Our main goal is to present a comparison of the currently used methods for the suffix tree construction and to point out some advantages and disadvantages of the individual approaches. We introduce, implement and practically evaluate multiple variations of the standard McCreight's and Ukkonen's algorithms, as well as Partition and Write Only Top Down (PWOTD) algorithm, originally developed for disk-based construction. Our main result is the integrated description and implementation of these algorithms, which are both well-suited to be further built upon. We also present a simple recommendations on when it is advisable to use a particular algorithm's variation and why.
|
|
|
Suffix tree construction with minimized branching
Bašista, Peter ; Dvořák, Tomáš (advisor) ; Kadlec, Rudolf (referee)
Suffix tree is a data structure which enables the performing of fast search-like operations on the text. In order to be used efficiently, it must be created quickly. In this thesis, we focus on the new kind of suffix link simulation called "minimized branching", which aims to increase the speed of suffix tree construction by reducing the number of branching operations. Our main goal is to present a comparison of the currently used methods for the suffix tree construction and to point out some advantages and disadvantages of the individual approaches. We introduce, implement and practically evaluate multiple variations of the standard McCreight's and Ukkonen's algorithms, as well as Partition and Write Only Top Down (PWOTD) algorithm, originally developed for disk-based construction. Our main result is the integrated description and implementation of these algorithms, which are both well-suited to be further built upon. We also present a simple recommendations on when it is advisable to use a particular algorithm's variation and why.
|
|
|
Visualisation of algorithms
Bašista, Peter ; Valla, Tomáš (referee) ; Mareš, Martin (advisor)
The goal of this work is to design a computer program for visualisation of algorithms and their execution in a classroom. The user writes the algorithm and attaches the prepared visualisation components to its data structures. The program will then record the progress of the computation and displays it as an interactive animation, alternatively it creates a PDF document with the key moments of the animation. In the presented work we introduce the Algorithm Animation Library. This library has been designed to be as flexible as possible, and at the same time as easy and friendly to use as possible. We present our approach towards animation of algorithms, briefly compare the developed library with the alternatives and conclude on when it is convenient to use the Algorithm Animation Library.
|
guest ::
