Lempel-Ziv (LZ77) factorization is a fundamental problem in string processing: Greedily
partition a given string T from left to right into blocks (called phrases) so that each phrase is …

A fundamental concept related to strings is that of repetitions. It has been extensively studied
in many versions, from both purely combinatorial and algorithmic angles. One of the most …

We introduce the natural notion of a matching frame in a $2 $-dimensional string. A
matching frame in a $2 $-dimensional $ n\times m $ string $ M $, is a rectangle such that the …

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 …

A $\lambda $-cover of a string $ S $ is a set of strings $\{C_i\} _1^\lambda $ such that every
index in $ S $ is contained in an occurrence of at least one string $ C_i $. The existence of a …

We consider the problems of computing maximal palindromes and distinct palindromes in
an edge-labeled rooted tree where each edge is labeled by a single character. Such a tree …

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