activity
20152021
most citedSpeeding Up String Matching by Weak Factor Recognition

4 citations · 6 across the 3 of their papers we have counts for

collaborators

6 papers

cs.DS2021

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…

cs.DS2019

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…

cs.DS2018

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…

cs.DS2018

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…

cs.DS20174 cited

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…

cs.CL20152 cited

Prior Polarity Lexical Resources for the Italian Language

Valeria Borzì, Simone Faro, Arianna Pavone +1

In this paper we present SABRINA (Sentiment Analysis: a Broad Resource for Italian Natural language Applications) a manually annotated prior polarity lexical resource for Italian n…