4 citations · 11 across the 9 of their papers we have counts for
8 papers · 1 filter
Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
Simone Faro, Arianna Pavone, Caterina Viola
String matching is a fundamental problem in computer science, with critical applications in text retrieval, bioinformatics, and data analysis. Among the numerous solutions that hav…
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…
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…
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…
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…
Flexible and Efficient Algorithms for Abelian Matching in Strings
Simone Faro, Arianna Pavone
The abelian pattern matching problem consists in finding all substrings of a text which are permutations of a given pattern. This problem finds application in many areas and can be…
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…