research
∙
02/06/2023
Optimal LZ-End Parsing is Hard
LZ-End is a variant of the well-known Lempel-Ziv parsing family such tha...
share
research
∙
01/11/2023
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie
The suffix trees are fundamental data structures for various kinds of st...
research
∙
11/08/2022
Computing palindromes on a trie in linear time
A trie 𝒯 is a rooted tree such that each edge is labeled by a single cha...
research
∙
10/05/2022
Computing maximal generalized palindromes
Palindromes are popular and important objects in textual data processing...
research
∙
04/15/2022
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
A palindromic substring T[i.. j] of a string T is said to be a shortest ...
research
∙
07/19/2021
Sensitivity of string compressors and repetitiveness measures
The sensitivity of a string compression algorithm C asks how much the ou...
research
∙
06/02/2021
On the approximation ratio of LZ-End to LZ77
A family of Lempel-Ziv factorizations is a well-studied string structure...
research
∙
05/25/2021
Minimal unique palindromic substrings after single-character substitution
A palindrome is a string that reads the same forward and backward. A pal...
research
∙
04/19/2021
A Separation of γ and b via Thue–Morse Words
We prove that for n≥ 2, the size b(t_n) of the smallest bidirectional sc...
research
∙
02/17/2020
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences
The equidistant subsequence pattern matching problem is considered. Give...
research
∙
10/25/2019
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements
The discrete acyclic convolution computes the 2n-1 sums sum_i+j=k; (i,j)...
research
∙
01/30/2019