Simone Faro

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 48

Top Venues

CoRR

Stringology

J. Discrete Algorithms

Theor. Comput. Sci.

Publications

Matthew N. Palmer, Simone Faro, Stefano Scafiti
Efficient Exact Online String Matching Through Linked Weak Factors. SEA (2024)
Simone Faro, Arianna Pavone, Caterina Viola
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. TAMC (2024)
Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone, Antonio Scardace
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples. FUN (2024)
Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
Quantum Circuits for Fixed Substring Matching Problems. CoRR (2023)
Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. CoRR (2023)
Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti
On the Longest Common Cartesian Substring Problem. Comput. J. 66 (4) (2023)
Simone Faro, Francesco Pio Marino, Arianna Pavone
Improved characters distance sampling for online and offline text searching. Theor. Comput. Sci. 946 (2023)
Simone Faro, Stefano Scafiti
Compact suffix automata representations for searching long patterns. Theor. Comput. Sci. 940 (Part) (2023)
Domenico Cantone, Simone Faro, Arianna Pavone
Quantum String Matching Unfolded and Extended. RC (2023)
Domenico Cantone, Simone Faro
The Many Qualities of a New Directly Accessible Compression Scheme. CoRR (2023)
Matthew N. Palmer, Simone Faro, Stefano Scafiti
Efficient Online String Matching through Linked Weak Factors. CoRR (2023)
Simone Faro, Stefano Scafiti
A weak approach to suffix automata simulation for exact and approximate string matching. Theor. Comput. Sci. 933 (2022)
Simone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. Stringology (2021)
Simone Faro, Francesco Pio Marino, Arianna Pavone
Enhancing Characters Distance Text Sampling by Condensed Alphabets. ICTCS (2021)
Simone Faro, Stefano Scafiti
Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings. ICTCS (2021)
Simone Faro, Stefano Scafiti
The Range Automaton: An Efficient Approach to Text-Searching. WORDS (2021)
Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. 849 (2021)
Domenico Cantone, Simone Faro, Arianna Pavone
Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR (2021)
Simone Faro, Stefano Scafiti
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. CIAA (2021)
Simone Faro, Francesco Pio Marino, Arianna Pavone
Efficient Online String Matching Based on Characters Distance Text Sampling. Algorithmica 82 (11) (2020)
Domenico Cantone, Simone Faro, M. Oguzhan Külekci
Shape-Preserving Pattern Matching. ICTCS (2020)
Simone Faro, Francesco Pio Marino, Stefano Scafiti
Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm. SOFSEM (Doctoral Student Research Forum) (2020)
Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
Fast Multiple Pattern Cartesian Tree Matching. WALCOM (2020)
Simone Faro, Francesco Pio Marino
Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. Stringology (2020)
Domenico Cantone, Simone Faro, Stefano Scafiti
Bit-Layers Text Encoding for Efficient Text Processing. SOFSEM (Doctoral Student Research Forum) (2020)
Domenico Cantone, Simone Faro, Arianna Pavone
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. WABI (2020)
Simone Faro, Thierry Lecroq, Kunsoo Park
Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. Stringology (2020)
Domenico Cantone, Simone Faro, M. Oguzhan Külekci
The order-preserving pattern matching problem in practice. Discret. Appl. Math. 274 (2020)
Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
Fast Cartesian Tree Matching. CoRR (2019)
Domenico Cantone, Simone Faro, Arianna Pavone
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. ACM J. Exp. Algorithmics 24 (1) (2019)
Simone Faro, Arianna Pavone, Francesco Pio Marino
Efficient Online String Matching Based on Characters Distance Text Sampling. CoRR (2019)
Simone Faro, Arianna Pavone
Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. IWBBIO (1) (2019)
Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
Fast Multiple Pattern Cartesian Tree Matching. CoRR (2019)
Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
Fast Cartesian Tree Matching. SPIRE (2019)
Simone Faro, Arianna Pavone
Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence. IWBBIO (1) (2019)
Domenico Cantone, Simone Faro, Arianna Pavone
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR (2018)
Dario Catalano, Mario Di Raimondo, Simone Faro
Verifiable pattern matching on outsourced texts. J. Discrete Algorithms 51 (2018)
Simone Faro, Arianna Pavone
Flexible and Efficient Algorithms for Abelian Matching in Strings. CoRR (2018)
Simone Faro, Arianna Pavone
An Efficient Skip-Search Approach to Swap Matching. Comput. J. 61 (9) (2018)
Domenico Cantone, Simone Faro, Arianna Pavone
Speeding Up String Matching by Weak Factor Recognition. Stringology (2017)
Domenico Cantone, Simone Faro, Arianna Pavone
Speeding Up String Matching by Weak Factor Recognition. CoRR (2017)
Tamanna Chhabra, Simone Faro, M. Oguzhan Külekci, Jorma Tarhio
Engineering order-preserving pattern matching with SIMD parallelism. Softw. Pract. Exp. 47 (5) (2017)
Simone Faro
Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences. AlCoB (2016)
Simone Faro
A Very Fast String Matching Algorithm Based on Condensed Alphabets. AAIM (2016)
Simone Faro
Exact Online String Matching Bibliography. CoRR (2016)
Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio
The String Matching Algorithms Research Tool. Stringology (2016)
Dario Catalano, Mario Di Raimondo, Simone Faro
Verifiable Pattern Matching on Outsourced Texts. SCN (2016)
Simone Faro, M. Oguzhan Külekci
Efficient Algorithms for the Order Preserving Pattern Matching Problem. AAIM (2016)
Domenico Cantone, Simone Faro, M. Oguzhan Külekci
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. Stringology (2015)
Simone Faro, Arianna Pavone
Refined Tagging of Complex Verbal Phrases for the Italian Language. Stringology (2015)
Simone Faro, M. Oguzhan Külekci
Efficient Algorithms for the Order Preserving Pattern Matching Problem. CoRR (2015)
Boran Adas, Ersin Bayraktar, Simone Faro, Ibraheem Elsayed Moustafa, M. Oguzhan Külekci
Nucleotide Sequence Alignment and Compression via Shortest Unique Substring. IWBBIO (2) (2015)
Valeria Borzì, Simone Faro, Arianna Pavone, Sabrina Sansone
Prior Polarity Lexical Resources for the Italian Language. CoRR (2015)
Domenico Cantone, Simone Faro
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs. J. Discrete Algorithms 24 (2014)
Valeria Borzì, Simone Faro, Arianna Pavone
Automatic Extraction of Semantic Relations by Using Web Statistical Information. ICCS (2014)
Domenico Cantone, Simone Faro
Improved and self-tuned occurrence heuristics. J. Discrete Algorithms 28 (2014)
Simone Faro, M. Oguzhan Külekci
Fast and flexible packed string matching. J. Discrete Algorithms 28 (2014)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
Text searching allowing for inversions and translocations of factors. Discret. Appl. Math. 163 (2014)
Domenico Cantone, Simone Faro
Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. Stringology (2014)
Simone Faro
Swap Matching in Strings by Simulating Reactive Automata. Stringology (2013)
Simone Faro, M. Oguzhan Külekci
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. Stringology (2013)
Domenico Cantone, Simone Faro
Improved and Self-Tuned Occurrence Heuristics. Stringology (2013)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
Efficient string-matching allowing for non-overlapping inversions. Theor. Comput. Sci. 483 (2013)
Simone Faro, M. Oguzhan Külekci
Fast Packed String Matching for Short Patterns. ALENEX (2013)
Simone Faro, Thierry Lecroq
The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. 45 (2) (2013)
Simone Faro, Thierry Lecroq
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA (2012)
Simone Faro, M. Oguzhan Külekci
Fast Packed String Matching for Short Patterns CoRR (2012)
Simone Faro, M. Oguzhan Külekci
Fast Multiple String Matching Using Streaming SIMD Extensions Technology. SPIRE (2012)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. J. Discrete Algorithms 11 (2012)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts. Int. J. Found. Comput. Sci. 23 (2) (2012)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213 (2012)
Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta
Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23 (2) (2012)
Simone Faro, Thierry Lecroq
Fast searching in biological sequences using multiple hash functions. BIBE (2012)
Simone Faro, Thierry Lecroq
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA (2012)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. CPM (2011)
Simone Faro, Thierry Lecroq
2001-2010: Ten Years of Exact String Matching Algorithms. Stringology (2011)
Szymon Grabowski, Simone Faro, Emanuele Giaquinta
String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett. 111 (11) (2011)
Szymon Grabowski, Simone Faro, Emanuele Giaquinta
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time) CoRR (2010)
Simone Faro, Thierry Lecroq
The Exact String Matching Problem: a Comprehensive Experimental Evaluation CoRR (2010)
Domenico Cantone, Simone Faro
On Tuning the Bad-Character Rule: the Worst-Character Rule CoRR (2010)
Simone Faro, Elisa Pappalardo
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. SOFSEM (2010)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
A Space-Efficient Implementation of the Good-Suffix Heuristic. Stringology (2010)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
Approximate String Matching Allowing for Inversions and Translocations. Stringology (2010)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. CPM (2010)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
: Getting to the Next Level of Parallelism. FUN (2010)
Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta
An Efficient Algorithm for Approximate Pattern Matching with Swaps. Stringology (2009)
Simone Faro, Thierry Lecroq
Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20 (6) (2009)
Matteo Campanelli, Domenico Cantone, Simone Faro
A New Algorithm for Efficient Pattern Matching with Swaps. IWOCA (2009)
Domenico Cantone, Simone Faro
Pattern Matching with Swaps for Short Patterns in Linear Time. SOFSEM (2009)
Simone Faro, Thierry Lecroq
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM (2009)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval. Int. J. Found. Comput. Sci. 20 (6) (2009)
Domenico Cantone, Simone Faro, Emanuele Giaquinta
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. Stringology (2009)
Domenico Cantone, Salvatore Cristofaro, Simone Faro, Emanuele Giaquinta
Finite State Models for the Generation of Large Corpora of Natural Language Texts. FSMNLP (2008)
Simone Faro, Thierry Lecroq
Efficient Pattern Matching on Binary Strings CoRR (2008)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences. Int. J. Found. Comput. Sci. 19 (1) (2008)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences. Stringology (2008)
Simone Faro, Thierry Lecroq
Efficient Variants of the Backward-Oracle-Matching Algorithm. Stringology (2008)
Domenico Cantone, Salvatore Cristofaro, Simone Faro
On some combinatorial problems concerning the harmonic structure of musical chord sequences. Stringology (2006)
Domenico Cantone, Simone Faro
A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. Int. J. Found. Comput. Sci. 17 (6) (2006)
Domenico Cantone, Simone Faro
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. J. Autom. Lang. Comb. 10 (5/6) (2005)

Simone Faro.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Simone Faro