Faster algorithms for longest common substring
P Charalampopoulos, T Kociumaka, SP Pissis… - arXiv preprint arXiv …, 2021 - arxiv.org
In the classic longest common substring (LCS) problem, we are given two strings $ S $ and
$ T $, each of length at most $ n $, over an alphabet of size $\sigma $, and we are asked to …
$ T $, each of length at most $ n $, over an alphabet of size $\sigma $, and we are asked to …
Quantum string matching unfolded and extended
The string matching problem is one of the fundamental problems in computer science with
applications in a variety of fields. Basically, it consists in finding all occurrences of a given …
applications in a variety of fields. Basically, it consists in finding all occurrences of a given …
A weak approach to suffix automata simulation for exact and approximate string matching
S Faro, S Scafiti - Theoretical Computer Science, 2022 - Elsevier
String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …
due to its direct applications to such diverse areas as text, image and signal processing …
An efficient skip-search approach to swap matching
The swap matching problem consists in finding all occurrences of a pattern x of length m in a
text y of length n, allowing for disjoint local swaps of characters in the pattern. In 2003, Amir …
text y of length n, allowing for disjoint local swaps of characters in the pattern. In 2003, Amir …
[PDF][PDF] Twenty years of bit-parallelism in string matching
It has been twenty years since the publication of the two seminal papers of Baeza-Yates and
Gonnet and of Wu and Manber in the September 1992 issue of the Communications of the …
Gonnet and of Wu and Manber in the September 1992 issue of the Communications of the …
A new algorithm for efficient pattern matching with swaps
Abstract The Pattern Matching problem with Swaps consists in finding all occurrences of a
pattern P in a text T, when disjoint local swaps in the pattern are allowed. In this paper, we …
pattern P in a text T, when disjoint local swaps in the pattern are allowed. In this paper, we …
[PDF][PDF] Swap Matching in Strings by Simulating Reactive Automata.
S Faro - Stringology, 2013 - stringology.org
The pattern matching problem with swaps consists in finding all occurrences of a pattern P in
a text T, when disjoint local swaps in the pattern are allowed. In this paper we introduce a …
a text T, when disjoint local swaps in the pattern are allowed. In this paper we introduce a …
[HTML][HTML] The swap matching problem revisited
P Ahmed, CS Iliopoulos, ASMS Islam… - Theoretical Computer …, 2014 - Elsevier
In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap
Matching problem, for short). We first present a graph-theoretic model, which opens a new …
Matching problem, for short). We first present a graph-theoretic model, which opens a new …
Rappresentazioni compatte dell'automa suffisso per lo string matching
S Scafiti - 2024 - tesidottorato.depositolegale.it
String matching is a fundamental problem in computer science, with a myriad of direct
applications into several distinct areas of computing, including information retrieval, data …
applications into several distinct areas of computing, including information retrieval, data …
On a compact encoding of the swap automaton
K Fredriksson, E Giaquinta - Information Processing Letters, 2014 - Elsevier
Given a string P of length m over an alphabet Σ of size σ, a swapped version of P is a string
derived from P by a series of local swaps, ie, swaps of adjacent symbols, such that each …
derived from P by a series of local swaps, ie, swaps of adjacent symbols, such that each …