Simone Faro - Research

Research interest

Text and strings processing algorithms
Simulation of nondeterministic finite automata
Exact and approximate pattern matching
Multiple string matching
Data compression
Pattern matching on compressed texts
Combinatorial algorithms on graphs
Privacy preserving text processing

Talks given

[18]	Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011) Palermo, Italy Given on 27-29 June 2011
[17]	Compact Representations of Nondeterministic Automata for the Bit-Parallel Approach London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2011 King's College, London, UK Given on February 2011
[16]	Approximate String Matching Allowing for Inversions and Translocations the Prague Stringology Conference 2010 Prague, Czech Republic Given on Septempber 2010
[15]	A Space-Efficient Implementation of the Good-Suffix Heuristic the Prague Stringology Conference 2010 Prague, Czech Republic Given on September 2010
[14]	Bit-(Parallelism)^2: Getting to the Next Level of Parallelism Fifth International Conference on Fun With Algorithms Ischia, Italy Given on June 2010
[13]	On the Bit-Parallel Simulation of the Nondeterministic Aho-Corasick Trie London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2010 Ischia, Italy Given on February 2010
[12]	Pattern Matching with Swaps for Short Patterns in Linear Time 35th International Conference on Current Trends in Theory and Practice of Computer Science Spindleruv Mlyn, Czech Republic Given on January 2009
[11]	A New Algorithm for Efficient Pattern Matching with Swaps 20th International Workshop on Combinatorial Algorithms Hradec nad Moravicí, Czech Republic Given on June 2009
[10]	Efficient Variants of the Backward-Oracle-Matching Algorithm the 13th Prague Stringology Conference 2008 Prague, Czech Republic Given on September 2008
[9]	New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps the 13th Prague Stringology Conference 2008 Prague, Czech Republic Given on September 2008
[8]	A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem University of Rouen Rouen, France Given on September 2007
[7]	A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem the Prague Stringology Conference 2005 Prague, Czech Republic Given on September 2005
[6]	Searching for a substring with constant extra space complexity Third International Conference on FUN with Algorithms Elba Island, Itlay Given on May 2004
[5]	Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm Cologne-Twente Workshop on Graphs and Combinatorial Optimization Milano, Itlay Given on May 2004
[4]	Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences the Prague Stringology Conference 2004 Prague, Czech Republic Given on September, 2004
[3]	Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm Second International Workshop on Experimental Algorithms Ascona, Switzerland Given on May 2003
[2]	Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm the Prague Stringology Conference 2003 Prague, Czech Republic Given on September 2003
[1]	On the Frequency of Characters in Natural Language Texts II AMAST Workshop On Language Processing Verona, Italy Given on August 2003