106 citations · 239 across the 67 of their papers we have counts for
71 papers · 1 filter
String Representation Based on Substring Equation Systems
Hiroki Shibata, Hideo Bannai
Repetitiveness measures quantify how much repetitive structure a string contains and serve as parameters for compressed representations and indexing data structures. Many compressi…
Sensitivity of Repetitiveness Measures to String Reversal
Hideo Bannai, Yuto Fujie, Peaker Guo +4
We study the impact that string reversal can have on several repetitiveness measures. First, we exhibit an infinite family of strings where the number, , of runs in the run-leng…
Online Computation of Palindromes and Suffix Trees on Tries
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno +5
We consider the problems of computing maximal palindromes and distinct palindromes in a trie. A trie is a natural generalization of a string, which can be seen as a single-path tre…
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
Kaisei Kishi, Kazuki Kai, Yuto Nakashima +2
The Nyldon factorization is a string factorization that is a non-decreasing product of Nyldon words. Nyldon words and Nyldon factorizations are recently defined combinatorial objec…
Tight bounds on the number of non-equivalent parameterized squares in a word
Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima +3
Two words of the same length are said to be \emph{parameterized equivalent} if there exists a character bijection that transforms into . A word is called a paramet…
Height-bounded Lempel-Ziv encodings
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian +2
We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations that are variants of Lempel-Ziv parsings with a focus on bounding the worst-case access…