In sparse convolution-type problems, a common technique is to hash the input integers
modulo a random prime p∈[Q/2, Q] for some parameter Q, which reduces the range of the …

We consider subsequences with gap constraints, ie, length-k subsequences p that can be
embedded into a string w such that the induced gaps (ie, the factors of w between the …

In this paper, we consider a variant of the classical algorithmic problem of checking whether
a given word v is a subsequence of another word w. More precisely, we consider the …

Palindromes are non-empty strings that read the same forward and backward. The problem
of recognizing strings that can be represented as the concatenation of even-length …

In this overview, I present chronologically the published articles to which I contributed during
my doctoral studies. The papers that make up the chapters of this thesis, that is, Paper 1 [69] …

The simplicity of strings and their impactful usage puts their processing at the heart of many
applications, including Bioinformatics, Information Retrieval, and Cybersecurity. Exact …

A regular expression specifies a set of strings formed by single characters combined with
concatenation, union, and Kleene star operators. Given a regular expression R and a string …