We consider approximate circular pattern matching (CPM, in short) under the Hamming and
edit distance, in which we are given a length-$ n $ text $ T $, a length-$ m $ pattern $ P …

Background Circular string matching is a problem which naturally arises in many biological
contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text …

Cyclic versions of covers and roots of a string are considered in this paper. A prefix V of a
string S is a cyclic root of S if S is a concatenation of cyclic rotations of V. A prefix V of S is a …

Approximate string matching is the problem of finding all factors of a text t of length n that are
at a distance at most k from a pattern x of length m. Approximate circular string matching is …

Circular string matching is a problem which naturally arises in many contexts. It consists in
finding all occurrences of the rotations of a pattern of length m in a text of length n. There …

In this work, we consider pattern matching variants in small space, that is, in the read-only
setting, where we want to bound the space usage on top of storing the strings. Our main …

We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings $
S $ and $ T $ of length $ n $, we are to compute the longest factor of $ S $ whose cyclic shift …

Circular DNA sequences can be found in viruses, as plasmids in archaea and bacteria, and
in the mitochondria and plastids of eukaryotic cells. Hence, circular sequence comparison …

The problem of circular pattern matching is to find all rotations of a given pattern P in text T,
both over a common alphabet. The pattern and any of its rotations are also called …

Bitwise operations are executed very fast in computer architecture. Algorithms aiming to
benefit from this intrinsic property can be classified as bit-parallel algorithms. Bit-parallelism …