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 …

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 …

We consider the question of finding an approximate period in a given string S of length n. Let
S′ be a periodic string closest to S under some distance metric. We consider this distance …

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 …

Finding an approximate period in a given string S of length n is defined as follows. Let S′
be a periodic string closest to S under some distance metric, find the smallest period of S …

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 …

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 …

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 …

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 the Approximate Pattern …

String matching is a fundamental problem in computer science [1], with a myriad of direct
applications into several distinct areas of computing, including information retrieval, data …