Ing. Eliška Šestáková, Ph.D.

2015

With the vast amount of data needed to be archived, indexed and procesed, special data structures are required. The tree is a typical data structure which is used very often for hierarchically storing data. Specialized algorithms are needed for indexing tree data structures and also accessing, extracting and analyzing data stored in them. Another goal of this project is a design and implementation of novel methods of data compression and indexing in two areas: DNA sequence compression using dictionary methods and approximate pattern matching in genomes.

2014

With the vast amount of data needed to be archived, indexed and procesed, special data structures are required. The tree is a typical data structure which is used very often for hierarchically storing data. Specialized algorithms are needed for indexing tree data structures and also accessing, extracting and analyzing data stored in them. The aim of this research is to design efficient yet simple to understand algorithms dealing with tree pattern matching (both exact and approximate) and tree indexing, and provide a toolkit implementation. Another goal of this project is a design and implementation of novel methods of data compression in two areas: DNA sequence compression and difference compression of files.

2017 - 2019

With the vast amount of data needed to be archived, indexed and procesed, efficient data structures and algorithms are required. The tree is a typical data structure which is used very often for hierarchically storing data. Another goal of this project is to design and implement novel methods for data indexing combined with data compression and methods for various approximate pattern matching over the indexes. The indexes and pattern matching find applications in searching in DNA and RNA sequences. Another topic of our research is the area of algorithms for implementing dynamic programming languages.

2016

With the vast amount of data needed to be archived, indexed and procesed, efficient data structures and algorithms are required. The tree is a typical data structure which is used very often for hierarchically storing data. Another goal of this project is to design and implement novel methods for data indexing combined with data compression and methods for various approximate pattern matching over the indexes. The indexes and pattern matching find applications in searching in DNA and RNA sequences.