| 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 | 213 | 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 | 87 | 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 | 65 | 2003 |
| The String Matching Algorithms Research Tool. S Faro, T Lecroq, S Borzi, S Di Mauro, A Maggio Stringology, 99-111, 2016 | 57* | 2016 |
| The exact string matching problem: a comprehensive experimental evaluation S Faro, T Lecroq arXiv preprint arXiv:1012.2547, 2010 | 47 | 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 | 42 | 2010 |
| Fast packed string matching for short patterns S Faro, MO Külekci 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013 | 39 | 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 | 32 | 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 | 32 | 2012 |
| Efficient algorithms for the order preserving pattern matching problem S Faro, MO Külekci Algorithmic Aspects in Information and Management: 11th International …, 2016 | 29 | 2016 |
| Efficient string-matching allowing for non-overlapping inversions D Cantone, S Cristofaro, S Faro Theoretical Computer Science 483, 85-95, 2013 | 29 | 2013 |
| 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 |
| A multiple sliding windows approach to speed up string matching algorithms S Faro, T Lecroq Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012 | 26 | 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 | 26 | 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 | 26 | 2004 |
| 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 | 25 | 2005 |
| 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 |
| Fast and flexible packed string matching S Faro, MO Külekci Journal of Discrete Algorithms 28, 61-72, 2014 | 23 | 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 | 22 | 2009 |
| 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 | 22 | 2005 |
| An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. D Cantone, S Faro, MO Külekci Stringology, 22-35, 2015 | 21 | 2015 |
| Approximate String Matching Allowing for Inversions and Translocations. D Cantone, S Faro, E Giaquinta Stringology, 37-51, 2010 | 21 | 2010 |
| Engineering order‐preserving pattern matching with SIMD parallelism T Chhabra, S Faro, MO Külekci, J Tarhio Software: Practice and Experience 47 (5), 731-739, 2017 | 20 | 2017 |
| A very fast string matching algorithm based on condensed alphabets S Faro Algorithmic Aspects in Information and Management: 11th International …, 2016 | 19 | 2016 |
| Efficient algorithms for the δ-approximate string matching problem in musical sequences D Cantone, S Cristofaro, S Faro Proceedings of the Prague Stringology Conference, 33-47, 2004 | 19 | 2004 |
| Twenty years of bit-parallelism in string matching S Faro, T Lecroq, J Holub, BW Watson, J Žďárek Festschrift for Borivoj Melichar, 72-101, 2012 | 18 | 2012 |
| A new algorithm for efficient pattern matching with swaps M Campanelli, D Cantone, S Faro 20th International Workshop on Combinatorial Algorithms, 230-241, 2009 | 18 | 2009 |
| Searching for a Substring with Constant Extra Space Complexity D Cantone, S Faro Third International Conference on FUN with Algorithms, 118-131, 2004 | 18* | 2004 |
| Linear and efficient string matching algorithms based on weak factor recognition D Cantone, S Faro, A Pavone Journal of Experimental Algorithmics (JEA) 24, 1-20, 2019 | 16 | 2019 |
| Fast algorithms for single and multiple pattern Cartesian tree matching S Song, G Gu, C Ryu, S Faro, T Lecroq, K Park Theoretical Computer Science 849, 47-63, 2021 | 15 | 2021 |
| An efficient skip-search approach to swap matching S Faro, A Pavone, K Steinhofel The Computer Journal 61 (9), 1351-1360, 2018 | 15 | 2018 |
| Improved and Self-Tuned Occurrence Heuristics D Cantone, S Faro Prague Stringology Conference 2013, 2013 | 15 | 2013 |
| Bit-(parallelism) 2: Getting to the next level of parallelism D Cantone, S Faro, E Giaquinta Fifth International Conference on Fun with Algorithms, 166-177, 2010 | 15 | 2010 |
| Efficient pattern matching on binary strings S Faro, T Lecroq arXiv preprint arXiv:0810.2390, 2008 | 15 | 2008 |
| Evaluation and improvement of fast algorithms for exact matching on genome sequences S Faro Algorithms for Computational Biology: Third International Conference, AlCoB …, 2016 | 13 | 2016 |
| Forward-Fast-Search: another fast variant of the Boyer-Moore string matching algorithm D Cantone, S Faro Proceedings of the Prague Stringology Conference, 10-24, 2003 | 12 | 2003 |
| Speeding up string matching by weak factor recognition D Cantone, S Faro, A Pavone arXiv preprint arXiv:1707.00469, 2017 | 10 | 2017 |
| Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs D Cantone, S Faro Journal of Discrete Algorithms 24, 12-25, 2014 | 10 | 2014 |
| On the bit-parallel simulation of the nondeterministic Aho–Corasick and suffix automata for a set of patterns D Cantone, S Faro, E Giaquinta Journal of Discrete Algorithms 11, 25-36, 2012 | 9 | 2012 |
| Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. D Cantone, S Faro Stringology, 30-42, 2014 | 8 | 2014 |
| Text searching allowing for inversions and translocations of factors D Cantone, S Faro, E Giaquinta Discrete Applied Mathematics 163, 247-257, 2014 | 8 | 2014 |
| Fast searching in biological sequences using multiple hash functions S Faro, T Lecroq 2012 IEEE 12th International Conference on Bioinformatics & Bioengineering …, 2012 | 8 | 2012 |
| Adapting boyer-moore-like algorithms for searching huffman encoded texts D Cantone, S Faro, E Giaquinta International Journal of Foundations of Computer Science 23 (02), 343-356, 2012 | 8 | 2012 |
| Efficient matching of biological sequences allowing for non-overlapping inversions D Cantone, S Cristofaro, S Faro 22nd Annual Symposium on Combinatorial Pattern Matching, 364-375, 2011 | 8 | 2011 |
| Efficient online string matching based on characters distance text sampling S Faro, FP Marino, A Pavone Algorithmica 82 (11), 3390-3412, 2020 | 7 | 2020 |
| Nucleotide sequence alignment and compression via shortest unique substring B Adaş, E Bayraktar, S Faro, IE Moustafa, MO Külekci International Conference on Bioinformatics and Biomedical Engineering, 363-374, 2015 | 7 | 2015 |
| Swap Matching in Strings by Simulating Reactive Automata S Faro Prague Stringology Conference 2013, 2013 | 7 | 2013 |
| A weak approach to suffix automata simulation for exact and approximate string matching S Faro, S Scafiti Theoretical Computer Science 933, 88-103, 2022 | 6 | 2022 |
| The order-preserving pattern matching problem in practice D Cantone, S Faro, MO Külekci Discrete Applied Mathematics 274, 11-25, 2020 | 6 | 2020 |
| Fast cartesian tree matching S Song, C Ryu, S Faro, T Lecroq, K Park String Processing and Information Retrieval: 26th International Symposium …, 2019 | 6 | 2019 |
| Towards a Very Fast Multiple String Matching Algorithm for Short Patterns S Faro, MO Külekci Prague Stringology Conference 2013, 2013 | 6 | 2013 |
| The range automaton: an efficient approach to text-searching S Faro, S Scafiti Combinatorics on Words: 13th International Conference, WORDS 2021, Rouen …, 2021 | 5 | 2021 |
| Fast multiple pattern cartesian tree matching G Gu, S Song, S Faro, T Lecroq, K Park WALCOM: Algorithms and Computation: 14th International Conference, WALCOM …, 2020 | 5 | 2020 |
| Exact online string matching bibliography S Faro arXiv preprint arXiv:1605.05067, 2016 | 5 | 2016 |
| Automatic extraction of semantic relations by using web statistical information V Borzì, S Faro, A Pavone Graph-Based Representation and Reasoning: 21st International Conference on …, 2014 | 5 | 2014 |
| Pattern matching with swaps in practice M Campanelli, D Cantone, S Faro, E Giaquinta International Journal of Foundations of Computer Science 23 (02), 323-342, 2012 | 5 | 2012 |
| 2001–2010: Ten Years of Exact String Matching Algorithms S Faro, T Lecroq Proceedings of the Prague Stringology Conference 2011, 1, 2011 | 5 | 2011 |
| New Efficient Bit-Parallel Algorithms for the (δ, α)-Matching Problem with Applications in Music Information Retrieval D Cantone, S Cristofaro, S Faro International Journal of Foundations of Computer Science 20 (6), 1087-1108, 2009 | 5 | 2009 |
| A space efficient bit-parallel algorithm for the multiple string matching problem D Cantone, S Faro International Journal of Foundations of Computer Science 17 (06), 1235-1251, 2006 | 5 | 2006 |
| Solving the (δ, α)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences D Cantone, S Cristofaro, S Faro 6th International Conference on Music Information Retrieval, 2005 | 5 | 2005 |
| On the frequency of characters in natural language texts D Cantone, S Faro TWLT 21 Algebraic Methods in Language Processing, 69, 2003 | 5 | 2003 |
| Efficient string matching based on a two-step simulation of the suffix automaton S Faro, S Scafiti International Conference on Implementation and Application of Automata, 165-177, 2021 | 4 | 2021 |
| Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm. S Faro, FP Marino, S Scafiti SOFSEM (Doctoral Student Research Forum), 37-48, 2020 | 4 | 2020 |
| Sequence searching allowing for non-overlapping adjacent unbalanced translocations D Cantone, S Faro, A Pavone arXiv preprint arXiv:1812.00421, 2018 | 4 | 2018 |
| Verifiable pattern matching on outsourced texts D Catalano, M Di Raimondo, S Faro Journal of Discrete Algorithms 51, 39-50, 2018 | 4 | 2018 |
| Prior Polarity Lexical Resources for the Italian Language V Borzì, S Faro, A Pavone, S Sansone arXiv preprint arXiv:1507.00133, 2015 | 4 | 2015 |
| Pattern matching for control chart monitoring D Cantone, S Faro Progress in Industrial Mathematics at ECMI 2006, 918-922, 2008 | 4 | 2008 |
| Quantum string matching unfolded and extended D Cantone, S Faro, A Pavone International Conference on Reversible Computation, 117-133, 2023 | 3 | 2023 |
| Compact suffix automata representations for searching long patterns S Faro, S Scafiti Theoretical Computer Science 940, 254-268, 2023 | 3 | 2023 |
| Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. S Faro, FP Marino Stringology, 148-159, 2020 | 3 | 2020 |
| Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. S Faro, T Lecroq, K Park Stringology, 48-60, 2020 | 3 | 2020 |
| A Space-Efficient Implementation of the Good-Suffix Heuristic. D Cantone, S Cristofaro, S Faro Stringology, 63-75, 2010 | 3 | 2010 |
| An Efficient Algorithm for Approximate Pattern Matching with Swaps. M Campanelli, D Cantone, S Faro, E Giaquinta Stringology, 90-104, 2009 | 3 | 2009 |
| Finite state models for the generation of large corpora of natural language texts D Cantone, S Cristofaro, S Faro, E Giaquinta Finite-state Methods and Natural Language Processing: Postproceedings of the …, 2009 | 3 | 2009 |
| On the longest common Cartesian substring problem S Faro, T Lecroq, K Park, S Scafiti The Computer Journal 66 (4), 907-923, 2023 | 2 | 2023 |
| New efficient bit-parallel algorithms for the δ-matching problem with α-bounded gaps in musical sequences D Cantone, S Cristofaro, S Faro Proc. Prague Stringology Conference, PSC’08, 170-184, 2008 | 2 | 2008 |
| Enhancing Characters Distance Text Sampling by Condensed Alphabets. S Faro, FP Marino, A Pavone ICTCS, 1-15, 2021 | 1 | 2021 |
| Shape-Preserving Pattern Matching. D Cantone, S Faro, MO Külekci ICTCS, 137-148, 2020 | 1 | 2020 |
| Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors S Faro, A Pavone International Work-Conference on Bioinformatics and Biomedical Engineering …, 2019 | 1 | 2019 |
| Flexible and Efficient Algorithms for Abelian Matching in Strings S Faro, A Pavone arXiv preprint arXiv:1803.02807, 2018 | 1 | 2018 |
| Fast algorithms for online searching on Burrows-Wheeler transformed texts D Cantone, S Faro, E Giaquinta Festschrift for Boriovj Melichar, 61-71, 2012 | 1 | 2012 |
| On tuning the bad-character rule: the worst-character rule D Cantone, S Faro arXiv preprint arXiv:1012.1338, 2010 | 1 | 2010 |
| Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs D Cantone, S Faro 12th Italian Conference on Theoretical Computer Science, 2010 | 1 | 2010 |
| A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative Arcs D Cantone, S Faro 35th International Conference on Current Trends in Theory and Practice of …, 2009 | 1 | 2009 |
| Efficient Online String Matching through Linked Weak Factors MN Palmer, S Faro, S Scafiti arXiv preprint arXiv:2310.15711, 2023 | | 2023 |
| Longest Common Substring and Longest Palindromic Substring in Time D Cantone, S Faro, A Pavone, C Viola arXiv preprint arXiv:2309.01250, 2023 | | 2023 |
| Quantum Circuits for Fixed Substring Matching Problems D Cantone, S Faro, A Pavone, C Viola arXiv preprint arXiv:2308.11758, 2023 | | 2023 |
| The Many Qualities of a New Directly Accessible Compression Scheme D Cantone, S Faro arXiv preprint arXiv:2303.18063, 2023 | | 2023 |
| Improved characters distance sampling for online and offline text searching S Faro, FP Marino, A Pavone Theoretical Computer Science 946, 113684, 2023 | | 2023 |
| Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. S Faro, FP Marino, A Pavone, A Scardace Stringology, 75-89, 2021 | | 2021 |
| Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations D Cantone, S Faro, A Pavone arXiv preprint arXiv:2101.00718, 2021 | | 2021 |
| Proceedings of the 18th International Symposium on Experimental Algorithms (SEA 2020) S Faro, D Cantone Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020 | | 2020 |
| 18th International Symposium on Experimental Algorithms S Faro, D Cantone | | 2020 |
| LIPIcs, Volume 160, SEA 2020, Complete Volume S Faro, D Cantone 18th International Symposium on Experimental Algorithms (SEA 2020), 2020 | | 2020 |
| Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence S Faro, A Pavone Bioinformatics and Biomedical Engineering: 7th International Work-Conference …, 2019 | | 2019 |
| Refined Tagging of Complex Verbal Phrases for the Italian Language. S Faro, A Pavone Stringology, 132-145, 2015 | | 2015 |
| On some combinatorial problems concerning the harmonic structure of musical chord sequences D Cantone, S Cristofaro, S Faro Proceedings of the Prague Stringology Conference, 49-64, 2006 | | 2006 |
| Practical and theoretical aspects of String-Matching algorithms S Faro University of Catania, 2004 | | 2004 |
| Pruned BNDM: Extending the Bit-Parallel Suffix Automaton to Long Strings S Faro, S Scafiti | | |
Domenico CantoneProfessor of Computer Science, University of CataniaVerified email at dmi.unict.it
