16 citations · 56 across the 25 of their papers we have counts for
8 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…
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations
Domenico Cantone, Simone Faro, Arianna Pavone
Unbalanced translocations are among the most frequent chromosomal alterations, accounted for 30\% of all losses of heterozygosity, a major genetic event causing inactivation of tum…
Speeding Up String Matching by Weak Factor Recognition
Domenico Cantone, Simone Faro, Arianna Pavone
String matching is the problem of finding all the substrings of a text which match a given pattern. It is one of the most investigated problems in computer science, mainly due to i…