The last two decades have witnessed a dramatic increase in the amount of highly repetitive
datasets consisting of sequential data (strings, texts). Processing these massive amounts of …

The suffix array SA [1.. n] of a text T of length n is a permutation of {1,…, n} describing the
lexicographical ordering of suffixes of T and is considered to be one of the most important …

We consider several types of internal queries, that is, questions about fragments of a given
text specified in constant space by their locations in. Our main result is an optimal data …

Longest common substring (LCS) is an important text processing problem, which has
recently been investigated in the quantum query model. The decision version of this …

In the $ k $-Edit Circular Pattern Matching ($ k $-Edit CPM) problem, we are given a length-$
n $ text $ T $, a length-$ m $ pattern $ P $, and a positive integer threshold $ k $, and we are …

In this work, we revisit the fundamental and well-studied problem of approximate pattern
matching under edit distance. Given an integer k, a pattern P of length m, and a text T of …

We consider the approximate pattern matching problem under the edit distance. Given a text
T of length n, a pattern P of length m, and a threshold k, the task is to find the starting …

The decades-old Pattern Matching with Edits problem, given a length-n string T (the text), a
length-m string P (the pattern), and a positive integer k (the threshold), asks to list all …

The edit distance (also known as Levenshtein distance) of two strings is the minimum
number of insertions, deletions, and substitutions of characters needed to transform one …

The edit distance is a fundamental measure of sequence similarity, defined as the minimum
number of character insertions, deletions, and substitutions needed to transform one string …