My research interest spans over the areas of Algorithms and Combinatorics on sequences, Bioinformatics Algorithms, and Formal Languages.
I am also interested in Trace Monoids and Pattern Inference (Learning Theory).
Some time ago I have published work related to the formalism of networks of processors, and that of natural language processing.
Complexities for Jumps and Sweeps. JALC (with S. Fazekas, O. Wu)
Clusters of Repetition Roots Forming Prefix Chains. DCFS (with S. Fazekas)
A Toolkit for Parikh Matrices. CIAA (with L. Hutchinson, D. Reidenbach)
Reducing the ambiguity of Parikh matrices. TCS (with J. Dick, L. Hutchinson, D. Reidenbach)
Clusters of Repetition Roots: Single Chains. SOFSEM (with S. Fazekas)
On the Prefix-Suffix Duplication Reduction. IJFCS (with S. Fazekas, D. Reidenbach)
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. TCS (with H. Fernau, F. Manea, M.L. Schmid)
Hide and seek with repetitions. J. Comput. Syst. Sci. (with P. Gawrychowski, F. Manea, D. Nowotka)
Alignment-free sequence comparison using absent words. Inf. Comput. (with P. Charalampopoulos, M. Crochemore, G. Fici, S.P. Pissis)