The Prague Stringology Club
The stringology is 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.
