32 citations · 83 across the 17 of their papers we have counts for
16 papers · 1 filter
Longest Common Substring and Longest Palindromic Substring in Time
Domenico Cantone, Simone Faro, Arianna Pavone +1
The Longest Common Substring (LCS) and Longest Palindromic Substring (LPS) are classical problems in computer science, representing fundamental challenges in string processing. Bot…
Quantum Circuits for Fixed Substring Matching Problems
Domenico Cantone, Simone Faro, Arianna Pavone +1
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superi…
The Many Qualities of a New Directly Accessible Compression Scheme
Domenico Cantone, Simone Faro
We present a new variable-length computation-friendly encoding scheme, named SFDC (Succinct Format with Direct aCcesibility), that supports direct and fast accessibility to any ele…
Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations
Domenico Cantone, Simone Faro, Arianna Pavone
In this paper we investigate the \emph{approximate string matching problem} when the allowed edit operations are \emph{non-overlapping unbalanced translocations of adjacent factors…
Fast Multiple Pattern Cartesian Tree Matching
Geonmo Gu, Siwoo Song, Simone Faro +2
Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesi…
Efficient Online String Matching Based on Characters Distance Text Sampling
Simone Faro, Arianna Pavone, Francesco Pio Marino
Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, informat…