Measuring sequence similarity and compressing texts are among the most fundamental
tasks in string algorithms. In this work, we develop near-optimal quantum algorithms for the …

We show that the size γ (t_n) of the smallest string attractor of the n-th Thue-Morse word t_n
is 4 for any n ≥ 4, disproving the conjecture by Mantaci et al. ICTCS 2019 that it is n. We …

We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that
for any string w, a bidirectional macro scheme of size O (r B) can be induced from the BBWT …

This work establishes several strong hardness results on the problem of finding an ordering
on a string's alphabet that either minimizes or maximizes the number of factors in that string's …

Graph pangenomics is a new emerging field in computational biology that is changing the
traditional view of a reference genome from a linear sequence to a new paradigm: a …

The Lyndon factorization of a word has been largely studied and recently variants of it have
been introduced and investigated with different motivations. In particular, the canonical …

The Lyndon factorization of a word has been extensively studied in different contexts and
several variants of it have been proposed. In particular, the canonical inverse Lyndon …

A family of Lempel-Ziv factorizations is a well-studied string structure. The LZ-End
factorization is a member of the family that achieved faster extraction of any substrings (Kreft …

Sublinear time quantum algorithms have been established for many fundamental problems
on strings. This work demonstrates that new, faster quantum algorithms can be designed …

We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that
for any string w, a bidirectional macro scheme of size O (rB) can be induced from the BBWT …