A string w is called a minimal absent word (MAW) for a string S if w
doe...
Sliding suffix trees (Fiala Greene, 1989) for an input text T over a...
A trie 𝒯 is a rooted tree such that each edge is labeled by a
single cha...
Palindromes are popular and important objects in textual data processing...
Palindromes are strings that read the same forward and backward. Problem...
Let two static sequences of strings P and S, representing prefix and
suf...
A palindromic substring T[i.. j] of a string T is said to be a shortest
...
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...
A family of Lempel-Ziv factorizations is a well-studied string structure...
A palindrome is a string that reads the same forward and backward. A
pal...
A string w is called a minimal absent word (MAW) for another string T if...
We prove that for n≥ 2, the size b(t_n) of the smallest bidirectional
sc...
Let W be a string of length n over an alphabet Σ, k be a
positive intege...
We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter
...
The palindromic tree (a.k.a. eertree) for a string S of length n is a
tr...
A substring u of a string T is called a minimal unique substring (MUS) o...
Given a string T of length n, a substring u = T[i.. j] of T is called a
...