Alogirthms for Processing Tree Data Structures, Implementing Programming Languges and Data Compression
Program
Studentská grantová soutěž ČVUT
Provider
Czech Technical University in Prague
Departments
Investigators
Period
2017 - 2019
Description
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.
Processing Tree Data Structures and Data Compression
Program
Studentská grantová soutěž ČVUT
Provider
Czech Technical University in Prague
Investigators
Period
2016
Description
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.