The Prague Stringology Club has been founded at the Department of Computer Science and Engineering, Faculty of Electrical Engineering of Czech Technical University in Prague in 1996 as a research group working on the stringology. In 2009 the Prague Stringology Club moved to the Department of Theoretical Computer Science of new Faculty of Information Technology. The term stringology (for the first time used by Zvi Galil in 1984) denotes a science on algorithms on strings and sequences. It solves such problems like exact and approximate pattern matching, searching for repetitions in various texts,... etc. There are many areas that utilize the results of the stringology (information retrival, computer vision, computational biology, DNA processing,... etc.). The Prague Stringology Club uses finite automata approach to solve the problems in stringology. This theory has been developed and successfully used in the field of compiler construction and therefore it can be very useful in the field of stringology too.

Another topic of interest is the area of the compiler construction, both from the theoretical and the practical point of view. The compiler construction has a long tradition at the Department of Computer Science and Engineering. Recently, several theoretical results and practical commercial implementations of compilers have been created by members of Prague Stringology Club.

In 2005 the Prague Stringology Club extended the range of its research topics also to data compression. The members exploit rich experiences from stringology and apply them in data compression. It already resulted in several data compression papers and a joint project with a commercial company.

In 2008 some members of Prague Stringology Club started working on arbology, which is a new algorithmic discipline focusing on tree algorithms. Arbology solves problems such as tree pattern matching, tree indexing, finding repeats in trees, etc. For its algorithms, the arbology uses deterministic pushdown automaton as the basic model of computation.




Related Links

Created by: Jan Holub
Last updated: Jun 28 2024