Get started
Author

Simone Faro

Observed names: Faro S., Faro Simone, Faro, S., Faro, Simone, SIMONE FARO
ORCID: 0000-0001-5937-5796
Observed ORCID: 0000-0001-5937-5796
OpenAlex ID: A5105877451
The exact online string matching problem
2013 · Simone Faro, Thierry Lecroq · ACM Computing Surveys · 165
Efficient Variants of the Backward-oracle-matching Algorithm
2009 · SIMONE FARO, THIERRY LECROQ · International Journal of Foundations of Computer Science · 48
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
2010 · Faro, Simone, Lecroq, Thierry · arXiv (Cornell University) · 32
PDF
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm
2003 · Domenico Cantone, Simone Faro · Lecture notes in computer science · 30
The String Matching Algorithms Research Tool
2016 · Faro, S., Lecroq, Thierry, et al. · HAL · 28
Fast Packed String Matching for Short Patterns
2013 · Simone Faro, M. Oğuzhan Külekci · Society for Industrial and Applied Mathematics eBooks · 25
PDF
Efficient string-matching allowing for non-overlapping inversions
2012 · Domenico Cantone, Salvatore Cristofaro, et al. · Theoretical Computer Science · 25
Fast algorithms for single and multiple pattern Cartesian tree matching
2020 · Siwoo Song, Geonmo Gu, et al. · Theoretical Computer Science · 24
Fast Multiple String Matching Using Streaming SIMD Extensions Technology
2012 · Simone Faro, M. Oğuzhan Külekci · Lecture notes in computer science · 24
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
2009 · Simone Faro, Thierry Lecroq · Lecture notes in computer science · 24
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
2004 · Domenico Cantone, Simone Faro · Electronic Notes in Discrete Mathematics · 21
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
2012 · Domenico Cantone, Simone Faro, et al. · Information and Computation · 20
PDF
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
2009 · Simone Faro, Elisa Pappalardo · Lecture notes in computer science · 20
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms
2012 · Simone Faro, Thierry Lecroq · Lecture notes in computer science · 19
String matching with inversions and translocations in linear average time (most of the time)
2011 · Szymon Grabowski, Simone Faro, et al. · Information Processing Letters · 19
PDF
A Fast Suffix Automata Based Algorithm for Exact Online String Matching
2012 · Simone Faro, Thierry Lecroq · Lecture notes in computer science · 18
Pattern Matching with Swaps for Short Patterns in Linear Time
2009 · Domenico Cantone, Simone Faro · Lecture notes in computer science · 18
Efficient Algorithms for the Order Preserving Pattern Matching Problem
2016 · Simone Faro, M. Oğuzhan Külekci · Lecture notes in computer science · 17
Approximate String Matching Allowing for Inversions and Translocations.
2010 · Domenico Cantone, Simone Faro, et al. · 17
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm
2005 · Cantone, Domenico, Faro, Simone · Universitätsbibliothek Gießen · 17
Fast and flexible packed string matching
2014 · Simone Faro, M. Oğuzhan Külekci · Journal of Discrete Algorithms · 16
Engineering order‐preserving pattern matching with SIMD parallelism
2016 · Tamanna Chhabra, Simone Faro, et al. · Software Practice and Experience · 15
PDF
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
2010 · Domenico Cantone, Simone Faro, et al. · Lecture notes in computer science · 13
Efficient Pattern Matching on Binary Strings
2008 · Faro, Simone, Lecroq, Thierry · arXiv (Cornell University) · 12
PDF
An Efficient Algorithm for δ-Approximate Matching with α-Bounded Gaps in Musical Sequences
2005 · Domenico Cantone, Salvatore Cristofaro, et al. · Lecture notes in computer science · 12
Works count: 152
Citation count: 972
H-index: 17
I10-index: 31
Year
Topic
Type