Squares (fragments of the form xx, for some string x) are arguably the most natural type of
repetition in strings. The basic algorithmic question concerning squares is to check if a given …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

Given two indeterminate equal-length strings p and t with a set of characters per position in
both strings, we obtain a determinate string p_w from p and a determinate string t_w from t …

Covers are a kind of quasiperiodicity in strings. A string C is a cover of another string T if any
position of T is inside some occurrence of C in T. The shortest and longest cover arrays of T …

Stringology is a subfield of computer science dedicated to analyzing and processing
sequences of symbols. It plays a crucial role in various applications, including lossless …

An order-preserving square in a string is a fragment of the form $ uv $ where $ u\neq v $ and
$ u $ is order-isomorphic to $ v $. We show that a string $ w $ of length $ n $ over an …

In Cartesian tree matching, two strings match if the Cartesian trees of the strings are the
same. In this paper we define full, initial, and general periods in Cartesian tree matching …

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

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …