Ing. Petr Procházka, Ph.D.

2013

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 design and implementation of novel methods of data compression in two areas: first, music score compression; second, natural language compression.