Text Processing Research Group

We study algorithms for textual data, with a focus on string matching, combinatorics on words, indexing, and data compression.

Based at the University of Catania, our group develops efficient methods for searching, comparing, indexing, and representing large collections of text.

Our work connects theoretical foundations with practical algorithmic techniques, addressing problems in exact and approximate matching, compressed data structures, and the structural properties of strings.

String Matching

Efficient algorithms for exact, approximate, and generalized pattern matching, with applications ranging from text search to computational biology and information retrieval.

Combinatorics on Words

Algorithmic and structural aspects of strings, including periodicity, repetitions, word equations, indexing, and combinatorial pattern matching under generalized models.

Data Compression

Compression algorithms and compressed data structures for storing, indexing, and processing large collections of highly repetitive textual data.