default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimone Faro
Person information
- affiliation: University of Catania, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c63]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: 13:1-13:17- [c62]Francesco Pio Marino, Simone Faro, Antonio Scardace:
Practical Implementation of a Quantum String Matching Algorithm. QUASAR@HPDC 2024: 17-24 - [c61]Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. TAMC 2024: 247-259 - [c60]Matthew N. Palmer, Simone Faro, Stefano Scafiti:
Efficient Exact Online String Matching Through Linked Weak Factors. SEA 2024: 24:1-24:14 - 2023
- [j28]Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti:
On the Longest Common Cartesian Substring Problem. Comput. J. 66(4): 907-923 (2023) - [j27]Simone Faro, Stefano Scafiti:
Compact suffix automata representations for searching long patterns. Theor. Comput. Sci. 940(Part): 254-268 (2023) - [j26]Simone Faro, Francesco Pio Marino, Arianna Pavone:
Improved characters distance sampling for online and offline text searching. Theor. Comput. Sci. 946: 113684 (2023) - [c59]Domenico Cantone, Simone Faro, Arianna Pavone:
Quantum String Matching Unfolded and Extended. RC 2023: 117-133 - [i19]Domenico Cantone, Simone Faro:
The Many Qualities of a New Directly Accessible Compression Scheme. CoRR abs/2303.18063 (2023) - [i18]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuits for Fixed Substring Matching Problems. CoRR abs/2308.11758 (2023) - [i17]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. CoRR abs/2309.01250 (2023) - [i16]Matthew N. Palmer, Simone Faro, Stefano Scafiti:
Efficient Online String Matching through Linked Weak Factors. CoRR abs/2310.15711 (2023) - 2022
- [j25]Simone Faro, Stefano Scafiti:
A weak approach to suffix automata simulation for exact and approximate string matching. Theor. Comput. Sci. 933: 88-103 (2022) - 2021
- [j24]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: 47-63 (2021) - [c58]Simone Faro, Stefano Scafiti:
The Range Automaton: An Efficient Approach to Text-Searching. WORDS 2021: 91-103 - [c57]Simone Faro, Francesco Pio Marino, Arianna Pavone:
Enhancing Characters Distance Text Sampling by Condensed Alphabets. ICTCS 2021: 1-15 - [c56]Simone Faro, Stefano Scafiti:
Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings. ICTCS 2021: 328-340 - [c55]Simone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace:
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. Stringology 2021: 75-89 - [c54]Simone Faro, Stefano Scafiti:
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. CIAA 2021: 165-177 - [i15]Domenico Cantone, Simone Faro, Arianna Pavone:
Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR abs/2101.00718 (2021) - 2020
- [j23]Simone Faro, Francesco Pio Marino, Arianna Pavone:
Efficient Online String Matching Based on Characters Distance Text Sampling. Algorithmica 82(11): 3390-3412 (2020) - [j22]Domenico Cantone, Simone Faro, M. Oguzhan Külekci:
The order-preserving pattern matching problem in practice. Discret. Appl. Math. 274: 11-25 (2020) - [c53]Domenico Cantone, Simone Faro, M. Oguzhan Külekci:
Shape-Preserving Pattern Matching. ICTCS 2020: 137-148 - [c52]Domenico Cantone, Simone Faro, Stefano Scafiti:
Bit-Layers Text Encoding for Efficient Text Processing. SOFSEM (Doctoral Student Research Forum) 2020: 13-24 - [c51]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: 37-48 - [c50]Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. Stringology 2020: 48-60 - [c49]Simone Faro, Francesco Pio Marino:
Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. Stringology 2020: 148-159 - [c48]Domenico Cantone, Simone Faro, Arianna Pavone:
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. WABI 2020: 19:1-19:14 - [c47]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. WALCOM 2020: 107-119 - [e1]Simone Faro, Domenico Cantone:
18th International Symposium on Experimental Algorithms, SEA 2020, June 16-18, 2020, Catania, Italy. LIPIcs 160, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-148-1 [contents]
2010 – 2019
- 2019
- [j21]Domenico Cantone, Simone Faro, Arianna Pavone:
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. ACM J. Exp. Algorithmics 24(1): 1.8:1-1.8:20 (2019) - [c46]Simone Faro, Arianna Pavone:
Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. IWBBIO (1) 2019: 120-131 - [c45]Simone Faro, Arianna Pavone:
Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence. IWBBIO (1) 2019: 307-318 - [c44]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. SPIRE 2019: 124-137 - [i14]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. CoRR abs/1908.04937 (2019) - [i13]Simone Faro, Arianna Pavone, Francesco Pio Marino:
Efficient Online String Matching Based on Characters Distance Text Sampling. CoRR abs/1908.05930 (2019) - [i12]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. CoRR abs/1911.01644 (2019) - 2018
- [j20]Simone Faro, Arianna Pavone:
An Efficient Skip-Search Approach to Swap Matching. Comput. J. 61(9): 1351-1360 (2018) - [j19]Dario Catalano, Mario Di Raimondo, Simone Faro:
Verifiable pattern matching on outsourced texts. J. Discrete Algorithms 51: 39-50 (2018) - [i11]Simone Faro, Arianna Pavone:
Flexible and Efficient Algorithms for Abelian Matching in Strings. CoRR abs/1803.02807 (2018) - [i10]Domenico Cantone, Simone Faro, Arianna Pavone:
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR abs/1812.00421 (2018) - 2017
- [j18]Tamanna Chhabra, Simone Faro, M. Oguzhan Külekci, Jorma Tarhio:
Engineering order-preserving pattern matching with SIMD parallelism. Softw. Pract. Exp. 47(5): 731-739 (2017) - [c43]Domenico Cantone, Simone Faro, Arianna Pavone:
Speeding Up String Matching by Weak Factor Recognition. Stringology 2017: 42-50 - [i9]Domenico Cantone, Simone Faro, Arianna Pavone:
Speeding Up String Matching by Weak Factor Recognition. CoRR abs/1707.00469 (2017) - 2016
- [c42]Simone Faro:
A Very Fast String Matching Algorithm Based on Condensed Alphabets. AAIM 2016: 65-76 - [c41]Simone Faro, M. Oguzhan Külekci:
Efficient Algorithms for the Order Preserving Pattern Matching Problem. AAIM 2016: 185-196 - [c40]Simone Faro:
Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences. AlCoB 2016: 145-157 - [c39]Dario Catalano, Mario Di Raimondo, Simone Faro:
Verifiable Pattern Matching on Outsourced Texts. SCN 2016: 333-350 - [c38]Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio:
The String Matching Algorithms Research Tool. Stringology 2016: 99-111 - [i8]Simone Faro:
Exact Online String Matching Bibliography. CoRR abs/1605.05067 (2016) - 2015
- [c37]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: 363-374 - [c36]Domenico Cantone, Simone Faro, M. Oguzhan Külekci:
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. Stringology 2015: 22-35 - [c35]Simone Faro, Arianna Pavone:
Refined Tagging of Complex Verbal Phrases for the Italian Language. Stringology 2015: 132-145 - [i7]Simone Faro, M. Oguzhan Külekci:
Efficient Algorithms for the Order Preserving Pattern Matching Problem. CoRR abs/1501.04001 (2015) - [i6]Valeria Borzì, Simone Faro, Arianna Pavone, Sabrina Sansone:
Prior Polarity Lexical Resources for the Italian Language. CoRR abs/1507.00133 (2015) - 2014
- [j17]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Text searching allowing for inversions and translocations of factors. Discret. Appl. Math. 163: 247-257 (2014) - [j16]Domenico Cantone, Simone Faro:
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs. J. Discrete Algorithms 24: 12-25 (2014) - [j15]Simone Faro, M. Oguzhan Külekci:
Fast and flexible packed string matching. J. Discrete Algorithms 28: 61-72 (2014) - [j14]Domenico Cantone, Simone Faro:
Improved and self-tuned occurrence heuristics. J. Discrete Algorithms 28: 73-84 (2014) - [c34]Valeria Borzì, Simone Faro, Arianna Pavone:
Automatic Extraction of Semantic Relations by Using Web Statistical Information. ICCS 2014: 174-187 - [c33]Domenico Cantone, Simone Faro:
Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. Stringology 2014: 30-42 - 2013
- [j13]Simone Faro, Thierry Lecroq:
The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. 45(2): 13:1-13:42 (2013) - [j12]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
Efficient string-matching allowing for non-overlapping inversions. Theor. Comput. Sci. 483: 85-95 (2013) - [c32]Simone Faro, M. Oguzhan Külekci:
Fast Packed String Matching for Short Patterns. ALENEX 2013: 113-121 - [c31]Simone Faro:
Swap Matching in Strings by Simulating Reactive Automata. Stringology 2013: 7-20 - [c30]Simone Faro, M. Oguzhan Külekci:
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. Stringology 2013: 78-91 - [c29]Domenico Cantone, Simone Faro:
Improved and Self-Tuned Occurrence Heuristics. Stringology 2013: 92-106 - 2012
- [j11]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213: 3-12 (2012) - [j10]Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23(2): 323-342 (2012) - [j9]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts. Int. J. Found. Comput. Sci. 23(2): 343-356 (2012) - [j8]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: 25-36 (2012) - [c28]Simone Faro, Thierry Lecroq:
Fast searching in biological sequences using multiple hash functions. BIBE 2012: 175-180 - [c27]Simone Faro, M. Oguzhan Külekci:
Fast Multiple String Matching Using Streaming SIMD Extensions Technology. SPIRE 2012: 217-228 - [c26]Simone Faro, Thierry Lecroq:
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA 2012: 172-183 - [c25]Simone Faro, Thierry Lecroq:
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA 2012: 149-158 - [i5]Simone Faro, M. Oguzhan Külekci:
Fast Packed String Matching for Short Patterns. CoRR abs/1209.6449 (2012) - 2011
- [j7]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): 516-520 (2011) - [c24]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. CPM 2011: 364-375 - [c23]Simone Faro, Thierry Lecroq:
2001-2010: Ten Years of Exact String Matching Algorithms. Stringology 2011: 1-2 - 2010
- [c22]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. CPM 2010: 288-298 - [c21]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Bit-(Parallelism)2: Getting to the Next Level of Parallelism. FUN 2010: 166-177 - [c20]Simone Faro, Elisa Pappalardo:
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. SOFSEM 2010: 370-381 - [c19]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Approximate String Matching Allowing for Inversions and Translocations. Stringology 2010: 37-51 - [c18]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
A Space-Efficient Implementation of the Good-Suffix Heuristic. Stringology 2010: 63-75 - [i4]Szymon Grabowski, Simone Faro, Emanuele Giaquinta:
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time). CoRR abs/1012.0280 (2010) - [i3]Domenico Cantone, Simone Faro:
On Tuning the Bad-Character Rule: the Worst-Character Rule. CoRR abs/1012.1338 (2010) - [i2]Simone Faro, Thierry Lecroq:
The Exact String Matching Problem: a Comprehensive Experimental Evaluation. CoRR abs/1012.2547 (2010)
2000 – 2009
- 2009
- [j6]Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) - [j5]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): 1087-1108 (2009) - [c17]Simone Faro, Thierry Lecroq:
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM 2009: 106-115 - [c16]Matteo Campanelli, Domenico Cantone, Simone Faro:
A New Algorithm for Efficient Pattern Matching with Swaps. IWOCA 2009: 230-241 - [c15]Domenico Cantone, Simone Faro:
Pattern Matching with Swaps for Short Patterns in Linear Time. SOFSEM 2009: 255-266 - [c14]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. Stringology 2009: 29-39 - [c13]Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
An Efficient Algorithm for Approximate Pattern Matching with Swaps. Stringology 2009: 90-104 - 2008
- [j4]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): 103-124 (2008) - [c12]Domenico Cantone, Salvatore Cristofaro, Simone Faro, Emanuele Giaquinta:
Finite State Models for the Generation of Large Corpora of Natural Language Texts. FSMNLP 2008: 175-182 - [c11]Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Stringology 2008: 146-160 - [c10]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: 170184 - [i1]Simone Faro, Thierry Lecroq:
Efficient Pattern Matching on Binary Strings. CoRR abs/0810.2390 (2008) - 2006
- [j3]Domenico Cantone, Simone Faro:
A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. Int. J. Found. Comput. Sci. 17(6): 1235-1252 (2006) - [c9]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
On some combinatorial problems concerning the harmonic structure of musical chord sequences. Stringology 2006: 49-64 - 2005
- [j2]Domenico Cantone, Simone Faro:
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. J. Autom. Lang. Comb. 10(5/6): 589-608 (2005) - [c8]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences. ISMIR 2005: 454-459 - [c7]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences. ISMIR 2005: 460-463 - [c6]Domenico Cantone, Simone Faro:
A space efficient bit-parallel algorithm for the multiple string matching problem. Stringology 2005: 109-124 - [c5]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences. WEA 2005: 428-439 - 2004
- [j1]Domenico Cantone, Simone Faro:
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm. Electron. Notes Discret. Math. 17: 81-86 (2004) - [c4]Domenico Cantone, Simone Faro:
Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm. CTW 2004: 75-80 - [c3]Domenico Cantone, Salvatore Cristofaro, Simone Faro:
Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. Stringology 2004: 33-47 - 2003
- [c2]Domenico Cantone, Simone Faro:
Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. Stringology 2003: 10-24 - [c1]Domenico Cantone, Simone Faro:
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. WEA 2003: 47-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
