Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. - Domenico Cantone; Simone Faro (Stringology, 2003)

Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. - Domenico Cantone; Simone Faro (WEA, 2003)

Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm. - Domenico Cantone; Simone Faro (CTW, 2004)

Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (Stringology, 2004)

Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm. - Domenico Cantone; Simone Faro (Electron. Notes Discret. Math., 2004)

On Tuning the ( delta, alpha)-Sequential-Sampling Algorithm for delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (ISMIR, 2005)

Solving the ( delta, alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (ISMIR, 2005)

An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (WEA, 2005)

Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. - Domenico Cantone; Simone Faro (J. Autom. Lang. Comb., 2005)

A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. - Domenico Cantone; Simone Faro (Int. J. Found. Comput. Sci., 2006)

Finite State Models for the Generation of Large Corpora of Natural Language Texts. - Domenico Cantone; Salvatore Cristofaro; Simone Faro; Emanuele Giaquinta (FSMNLP, 2008)

New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (Stringology, 2008)

Efficient Pattern Matching on Binary Strings - Simone Faro; Thierry Lecroq (CoRR, 2008)

On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (Int. J. Found. Comput. Sci., 2008)

An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. - Simone Faro; Thierry Lecroq (CPM, 2009)

A New Algorithm for Efficient Pattern Matching with Swaps. - Matteo Campanelli; Domenico Cantone; Simone Faro (IWOCA, 2009)

Pattern Matching with Swaps for Short Patterns in Linear Time. - Domenico Cantone; Simone Faro (SOFSEM, 2009)

An Efficient Algorithm for Approximate Pattern Matching with Swaps. - Matteo Campanelli; Domenico Cantone; Simone Faro; Emanuele Giaquinta (Stringology, 2009)

New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (Int. J. Found. Comput. Sci., 2009)

Efficient Variants of the Backward-Oracle-Matching Algorithm. - Simone Faro; Thierry Lecroq (Int. J. Found. Comput. Sci., 2009)

Bit-(Parallelism)2: Getting to the Next Level of Parallelism. - Domenico Cantone; Simone Faro; Emanuele Giaquinta (FUN, 2010)

Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. - Simone Faro; Elisa Pappalardo (SOFSEM, 2010)

A Space-Efficient Implementation of the Good-Suffix Heuristic. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (Stringology, 2010)

Approximate String Matching Allowing for Inversions and Translocations. - Domenico Cantone; Simone Faro; Emanuele Giaquinta (Stringology, 2010)

On Tuning the Bad-Character Rule: the Worst-Character Rule - Domenico Cantone; Simone Faro (CoRR, 2010)

The Exact String Matching Problem: a Comprehensive Experimental Evaluation - Simone Faro; Thierry Lecroq (CoRR, 2010)

Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (CPM, 2011)

2001-2010: Ten Years of Exact String Matching Algorithms. - Simone Faro; Thierry Lecroq (Stringology, 2011)

String matching with inversions and translocations in linear average time (most of the time). - Szymon Grabowski; Simone Faro; Emanuele Giaquinta (Inf. Process. Lett., 2011)

Fast searching in biological sequences using multiple hash functions. - Simone Faro; Thierry Lecroq (BIBE, 2012)

Fast Multiple String Matching Using Streaming SIMD Extensions Technology. - Simone Faro; M. Oguzhan Külekci (SPIRE, 2012)

A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. - Simone Faro; Thierry Lecroq (SEA, 2012)

A Fast Suffix Automata Based Algorithm for Exact Online String Matching. - Simone Faro; Thierry Lecroq (CIAA, 2012)

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. - Domenico Cantone; Simone Faro; Emanuele Giaquinta (Inf. Comput., 2012)

Pattern Matching with Swaps in Practice. - Matteo Campanelli; Domenico Cantone; Simone Faro; Emanuele Giaquinta (Int. J. Found. Comput. Sci., 2012)

Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts. - Domenico Cantone; Simone Faro; Emanuele Giaquinta (Int. J. Found. Comput. Sci., 2012)

On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. - Domenico Cantone; Simone Faro; Emanuele Giaquinta (J. Discrete Algorithms, 2012)

Fast Packed String Matching for Short Patterns. - Simone Faro; M. Oguzhan Külekci (ALENEX, 2013)

Swap Matching in Strings by Simulating Reactive Automata. - Simone Faro (Stringology, 2013)

Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. - Simone Faro; M. Oguzhan Külekci (Stringology, 2013)

The exact online string matching problem: A review of the most recent results. - Simone Faro; Thierry Lecroq (ACM Comput. Surv., 2013)

Efficient string-matching allowing for non-overlapping inversions. - Domenico Cantone; Salvatore Cristofaro; Simone Faro (Theor. Comput. Sci., 2013)

Automatic Extraction of Semantic Relations by Using Web Statistical Information. - Valeria Borzì; Simone Faro; Arianna Pavone (ICCS, 2014)

Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. - Domenico Cantone; Simone Faro (Stringology, 2014)

Text searching allowing for inversions and translocations of factors. - Domenico Cantone; Simone Faro; Emanuele Giaquinta (Discret. Appl. Math., 2014)

Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs. - Domenico Cantone; Simone Faro (J. Discrete Algorithms, 2014)

Improved and self-tuned occurrence heuristics. - Domenico Cantone; Simone Faro (J. Discrete Algorithms, 2014)

Fast and flexible packed string matching. - Simone Faro; M. Oguzhan Külekci (J. Discrete Algorithms, 2014)

Nucleotide Sequence Alignment and Compression via Shortest Unique Substring. - Boran Adas; Ersin Bayraktar; Simone Faro; Ibraheem Elsayed Moustafa; M. Oguzhan Külekci (IWBBIO (2), 2015)

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. - Domenico Cantone; Simone Faro; M. Oguzhan Külekci (Stringology, 2015)

Refined Tagging of Complex Verbal Phrases for the Italian Language. - Simone Faro; Arianna Pavone (Stringology, 2015)

Prior Polarity Lexical Resources for the Italian Language. - Valeria Borzì; Simone Faro; Arianna Pavone; Sabrina Sansone (CoRR, 2015)

A Very Fast String Matching Algorithm Based on Condensed Alphabets. - Simone Faro (AAIM, 2016)

Efficient Algorithms for the Order Preserving Pattern Matching Problem. - Simone Faro; M. Oguzhan Külekci (AAIM, 2016)

Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences. - Simone Faro (AlCoB, 2016)

The String Matching Algorithms Research Tool. - Simone Faro; Thierry Lecroq; Stefano Borzi; Simone Di Mauro; Alessandro Maggio (Stringology, 2016)

Exact Online String Matching Bibliography. - Simone Faro (CoRR, 2016)

Speeding Up String Matching by Weak Factor Recognition. - Domenico Cantone; Simone Faro; Arianna Pavone (Stringology, 2017)

Engineering order-preserving pattern matching with SIMD parallelism. - Tamanna Chhabra; Simone Faro; M. Oguzhan Külekci; Jorma Tarhio (Softw. Pract. Exp., 2017)

An Efficient Skip-Search Approach to Swap Matching. - Simone Faro; Arianna Pavone (Comput. J., 2018)

Flexible and Efficient Algorithms for Abelian Matching in Strings. - Simone Faro; Arianna Pavone (CoRR, 2018)

Verifiable pattern matching on outsourced texts. - Dario Catalano; Mario Di Raimondo; Simone Faro (J. Discrete Algorithms, 2018)

Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. - Simone Faro; Arianna Pavone (IWBBIO (1), 2019)

Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence. - Simone Faro; Arianna Pavone (IWBBIO (1), 2019)

Fast Cartesian Tree Matching. - Siwoo Song; Cheol Ryu; Simone Faro; Thierry Lecroq; Kunsoo Park (SPIRE, 2019)

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. - Domenico Cantone; Simone Faro; Arianna Pavone (ACM J. Exp. Algorithmics, 2019)

Shape-Preserving Pattern Matching. - Domenico Cantone; Simone Faro; M. Oguzhan Külekci (ICTCS, 2020)

Bit-Layers Text Encoding for Efficient Text Processing. - Domenico Cantone; Simone Faro; Stefano Scafiti (SOFSEM (Doctoral Student Research Forum), 2020)

Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm. - Simone Faro; Francesco Pio Marino; Stefano Scafiti (SOFSEM (Doctoral Student Research Forum), 2020)

Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. - Simone Faro; Thierry Lecroq; Kunsoo Park (Stringology, 2020)

Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. - Simone Faro; Francesco Pio Marino (Stringology, 2020)

Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. - Domenico Cantone; Simone Faro; Arianna Pavone (WABI, 2020)

Fast Multiple Pattern Cartesian Tree Matching. - Geonmo Gu; Siwoo Song; Simone Faro; Thierry Lecroq; Kunsoo Park (WALCOM, 2020)

Efficient Online String Matching Based on Characters Distance Text Sampling. - Simone Faro; Francesco Pio Marino; Arianna Pavone (Algorithmica, 2020)

The order-preserving pattern matching problem in practice. - Domenico Cantone; Simone Faro; M. Oguzhan Külekci (Discret. Appl. Math., 2020)

The Range Automaton: An Efficient Approach to Text-Searching. - Simone Faro; Stefano Scafiti (WORDS, 2021)

Enhancing Characters Distance Text Sampling by Condensed Alphabets. - Simone Faro; Francesco Pio Marino; Arianna Pavone (ICTCS, 2021)

Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings. - Simone Faro; Stefano Scafiti (ICTCS, 2021)

Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. - Simone Faro; Francesco Pio Marino; Arianna Pavone; Antonio Scardace (Stringology, 2021)

Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. - Simone Faro; Stefano Scafiti (CIAA, 2021)

Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. - Domenico Cantone; Simone Faro; Arianna Pavone (CoRR, 2021)

Fast algorithms for single and multiple pattern Cartesian tree matching. - Siwoo Song; Geonmo Gu; Cheol Ryu; Simone Faro; Thierry Lecroq; Kunsoo Park (Theor. Comput. Sci., 2021)

A weak approach to suffix automata simulation for exact and approximate string matching. - Simone Faro; Stefano Scafiti (Theor. Comput. Sci., 2022)

Quantum String Matching Unfolded and Extended. - Domenico Cantone; Simone Faro; Arianna Pavone (RC, 2023)

The Many Qualities of a New Directly Accessible Compression Scheme. - Domenico Cantone; Simone Faro (CoRR, 2023)

Quantum Circuits for Fixed Substring Matching Problems. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (CoRR, 2023)

Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (CoRR, 2023)

Efficient Online String Matching through Linked Weak Factors. - Matthew N. Palmer; Simone Faro; Stefano Scafiti (CoRR, 2023)

Compact suffix automata representations for searching long patterns. - Simone Faro; Stefano Scafiti (Theor. Comput. Sci., 2023)

Improved characters distance sampling for online and offline text searching. - Simone Faro; Francesco Pio Marino; Arianna Pavone (Theor. Comput. Sci., 2023)

On the Longest Common Cartesian Substring Problem. - Simone Faro; Thierry Lecroq; Kunsoo Park; Stefano Scafiti (Comput. J., 2023)

The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples. - Simone Faro; Francesco Pio Marino; Antonino Andrea Moschetto; Arianna Pavone; Antonio Scardace (FUN, 2024)

Quantum Circuit Based Longest Common Substring. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (ICTCS, 2024)

A New Directly Accessible Compression Scheme. - Simone Faro; Domenico Cantone (ICTCS, 2024)

Improving Sampled Matching through Character Context Sampling. - Simone Faro; Thierry Lecroq; Francesco Pio Marino; Arianna Pavone; Stefano Scafiti (ICTCS, 2024)

Families of Constant-Depth Quantum Circuits for Rotations and Permutations. - Simone Faro; Arianna Pavone; Caterina Viola (ICTCS, 2024)

Practical Implementation of a Quantum String Matching Algorithm. - Francesco Pio Marino; Simone Faro; Antonio Scardace (QUASAR@HPDC, 2024)

Quantum Circuits for Fixed Matching Substring Problems. - Domenico Cantone; Simone Faro; Arianna Pavone; Caterina Viola (SAI (3), 2024)

Beyond Horspool: A Comparative Analysis in Sampled Matching. - Simone Faro; Francesco Pio Marino; Antonino Andrea Moschetto (PSC, 2024)

Refining SFDC Compression Scheme with Block Text Segmentation. - Simone Faro; Alfio Spoto (PSC, 2024)

Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. - Simone Faro; Arianna Pavone; Caterina Viola (TAMC, 2024)

Efficient Exact Online String Matching Through Linked Weak Factors. - Matthew N. Palmer; Simone Faro; Stefano Scafiti (SEA, 2024)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism. - Simone Faro; Arianna Pavone; Caterina Viola (CoRR, 2025)

Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing. - Simone Faro; Francesco Pio Marino; Gabriele Messina (CoRR, 2025)