Simone Faro
Simone Faro
Associate Professor of Computer Science, University of Catania
Verifierad e-postadress på dmi.unict.it - Startsida
Titel
Citeras av
Citeras av
År
The Exact Online String Matching Problem: a Review of the Most Recent Results
S Faro, T Lecroq
ACM Computing Surveys (CSUR) 45 (2), 13, 2013
1492013
Efficient variants of the backward-oracle-matching algorithm
S Faro, T Lecroq
International Journal of Foundations of Computer Science 20 (06), 967-984, 2009
712009
Fast-Search: A new efficient variant of the Boyer-Moore string matching algorithm
D Cantone, S Faro
Second International Workshop on Experimental and Efficient Algorithms (WEA …, 2003
572003
The exact string matching problem: a comprehensive experimental evaluation
S Faro, T Lecroq
arXiv preprint arXiv:1012.2547, 2010
392010
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
D Cantone, S Faro, E Giaquinta
21st Annual Symposium on Combinatorial Pattern Matching, 288-298, 2010
332010
Efficient string-matching allowing for non-overlapping inversions.
D Cantone, S Cristofaro, S Faro
Theor. Comput. Sci. 483, 85-95, 2013
272013
The String Matching Algorithms Research Tool.
S Faro, T Lecroq, S Borzi, S Di Mauro, A Maggio
Stringology, 99-111, 2016
26*2016
Fast multiple string matching using streaming SIMD extensions technology
S Faro, MO Külekci
International Symposium on String Processing and Information Retrieval, 217-228, 2012
252012
An Efficient Algorithm for δ-Approximate Matching with α-Bounded Gaps in Musical Sequences
D Cantone, S Cristofaro, S Faro
4th International Workshop on Experimental and Efficient Algorithms (WEA …, 2005
252005
Efficient algorithms for the order preserving pattern matching problem
S Faro, MO Külekci
International Conference on Algorithmic Applications in Management, 185-196, 2016
242016
Fast packed string matching for short patterns
S Faro, MO Külekci
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013
242013
Fast-search algorithms: New efficient variants of the Boyer-Moore pattern-matching algorithm
D Cantone, S Faro
Journal of Automata Languages and Combinatorics 10 (5/6), 589, 2005
242005
A fast suffix automata based algorithm for exact online string matching
S Faro, T Lecroq
International Conference on Implementation and Application of Automata, 149-158, 2012
232012
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
D Cantone, S Faro
Electronic Notes in Discrete Mathematics 17, 81-86, 2004
232004
A multiple sliding windows approach to speed up string matching algorithms
S Faro, T Lecroq
International Symposium on Experimental Algorithms, 172-183, 2012
222012
String matching with inversions and translocations in linear average time (most of the time)
S Grabowski, S Faro, E Giaquinta
Information Processing Letters 111 (11), 2011
222011
An efficient matching algorithm for encoded DNA sequences and binary strings
S Faro, T Lecroq
20th Annual Symposium on Combinatorial Pattern Matching, 106-115, 2009
222009
On Tuning the (δ, α)-Sequential-Sampling Algorithm for δ-Approximate Matching with α-Bounded Gaps in Musical Sequences
D Cantone, S Cristofaro, S Faro
6th International Conference on Music Information Retrieval, 2005
212005
Approximate String Matching Allowing for Inversions and Translocations.
D Cantone, S Faro, E Giaquinta
Stringology, 37-51, 2010
192010
Ant-CSP: An ant colony optimization algorithm for the closest string problem
S Faro, E Pappalardo
International Conference on Current Trends in Theory and Practice of …, 2010
192010
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20