In this paper, we present the first study of the computational complexit...
We consider labeled directed graphs where each vertex is labeled with a
...
A string w is called a minimal absent word (MAW) for a string S if w
doe...
The directed acyclic word graph (DAWG) of a string y of length n is the
...
Sliding suffix trees (Fiala Greene, 1989) for an input text T over a...
Compact directed acyclic word graphs (CDAWGs) [Blumer et al. 1987] are a...
The suffix trees are fundamental data structures for various kinds of st...
A trie 𝒯 is a rooted tree such that each edge is labeled by a
single cha...
One of the most fundamental method for comparing two given strings A and...
Palindromes are popular and important objects in textual data processing...
Let two static sequences of strings P and S, representing prefix and
suf...
A string w is called a minimal absent word (MAW) for another string T if...
Grammar-based compression is a loss-less data compression scheme that
re...
Park et al. [TCS 2020] observed that the similarity between two (numeric...
The sensitivity of a string compression algorithm C asks how much the
ou...
The Cartesian-tree pattern matching is a recently introduced scheme of
p...
Counting substrings/subsequences that preserve some property (e.g.,
pali...
A family of Lempel-Ziv factorizations is a well-studied string structure...
Pattern matching is the most central task for text indices. Most recent
...
A string w is called a minimal absent word (MAW) for another string T if...
We consider the communication complexity of the Hamming distance of two
...
Let Σ and Π be disjoint alphabets, respectively called the static
alphab...
The Burrows-Wheeler-Transform (BWT), a reversible string transformation,...
The palindromic tree (a.k.a. eertree) for a string S of length n is a
tr...
The longest square subsequence (LSS) problem consists of computing a lon...
We show that the size γ(t_n) of the smallest string attractor of the
nth...
The similarity between a pair of time series, i.e., sequences of indexed...
The dynamic time warping (DTW) is a widely-used method that allows us to...
We deal with the problem of maintaining the suffix tree indexing structu...
We introduce a new class of straight-line programs (SLPs), named the Lyn...
The equidistant subsequence pattern matching problem is considered. Give...
Two strings x and y over Σ∪Π of equal length are said to
parameterized m...
The longest common subsequence (LCS) problem is a central problem in
str...
A substring u of a string T is called a minimal unique substring (MUS) o...
In a seminal paper of Charikar et al. on the smallest grammar problem, t...
We revisit the problem of longest common property preserving substring
q...
We present the first worst-case linear time algorithm that directly comp...
Given a string T of length n, a substring u = T[i.. j] of T is called a
...
Given a dynamic set K of k strings of total length n whose characters
ar...
The suffix tree, DAWG, and CDAWG are fundamental indexing structures of ...
For a string S, a palindromic substring S[i..j] is said to be a shortest...
Let Σ and Π be disjoint alphabets of respective size σ and
π. Two string...
Palindromes are important objects in strings which have been extensively...
A maximal repeat, or run, in a string, is a periodically maximal substri...
The suffix trees are fundamental data structures for various kinds of st...
We analyze the grammar generation algorithm of the RePair compression
al...
Two strings of equal length are said to parameterized match if there is ...
Mauer et al. [A Lempel-Ziv-style Compression Method for Repetitive Texts...
We propose a new generalization of palindromes and gapped palindromes ca...