Assistant Professor at
Department of Mathematics and Computer Science,
University of Catania.
Ph.D. in Computer Science, University of Catania, October 2004.
M.Sc. in Computer Science, University of Catania, September 2001.
Text and strings processing algorithms, simulation of nondeterministic finite automata, exact and approximate pattern matching, data compression and pattern matching on compressed texts and combinatorial algorithms on graphs
. . . pleasure has probably been the main goal all along. But I hesitate to admit it, because computer scientists want to maintain their image as hard-working individuals who deserve high salaries. Sooner or later society will realize that certain kinds of hard work are in fact admirable even though they are more fun than just about anything else.
Thierry Lecroq and I present smart,
a tool which provides a standard framework for researchers in string matching.
It helps users to test, design, evaluate and understand existing solutions for the exact string matching problem.
Moreover it provides the implementation of (almost) all string matching algorithms and a wide corpus of text buffers.