| 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 | 206 | 2013 |
| Efficient variants of the backward-oracle-matching algorithm S Faro, T Lecroq International Journal of Foundations of Computer Science 20 (06), 967-984, 2009 | 88 | 2009 |
| 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 | 66 | 2003 |
| The String Matching Algorithms Research Tool. S Faro, T Lecroq, S Borzi, S Di Mauro, A Maggio Stringology, 99-111, 2016 | 53* | 2016 |
| The exact string matching problem: a comprehensive experimental evaluation S Faro, T Lecroq arXiv preprint arXiv:1012.2547, 2010 | 45 | 2010 |
| 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 | 41 | 2010 |
| Fast packed string matching for short patterns S Faro, MO Külekci 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013 | 36 | 2013 |
| 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 | 31 | 2012 |
| A fast suffix automata based algorithm for exact online string matching S Faro, T Lecroq Implementation and Application of Automata: 17th International Conference …, 2012 | 31 | 2012 |
| 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 | 29 | 2005 |
| Efficient algorithms for the order preserving pattern matching problem S Faro, MO Külekci Algorithmic Aspects in Information and Management: 11th International …, 2016 | 28 | 2016 |
| Efficient string-matching allowing for non-overlapping inversions D Cantone, S Cristofaro, S Faro Theoretical Computer Science 483, 85-95, 2013 | 28 | 2013 |
| A multiple sliding windows approach to speed up string matching algorithms S Faro, T Lecroq Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012 | 27 | 2012 |
| 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 | 26 | 2011 |
| 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 | 25 | 2009 |
| Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm D Cantone, S Faro Electronic Notes in Discrete Mathematics 17, 81-86, 2004 | 25 | 2004 |
| Ant-CSP: An ant colony optimization algorithm for the closest string problem S Faro, E Pappalardo SOFSEM 2010: Theory and Practice of Computer Science: 36th Conference on …, 2010 | 24 | 2010 |
| 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 | 24 | 2005 |
| Fast and flexible packed string matching S Faro, MO Külekci Journal of Discrete Algorithms 28, 61-72, 2014 | 22 | 2014 |
| Pattern matching with swaps for short patterns in linear time D Cantone, S Faro International Conference on Current Trends in Theory and Practice of …, 2009 | 21 | 2009 |
Domenico CantoneProfessor of Computer Science, University of CataniaVerified email at dmi.unict.it
