106 citations · 239 across the 67 of their papers we have counts for
81 papers
On Occurrence-Preserving Morphisms
Kaisei Kishi, Peaker Guo, Cristian Urbina +1
A \emph{morphism} is a mapping that transforms words through letter-wise substitution, where each symbol is consistently replaced by a fixed word. In the field of combinatorics on…
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…
On the compressiveness of the Burrows-Wheeler transform
Hideo Bannai, Tomohiro I, Yuto Nakashima
The Burrows-Wheeler transform (BWT) is a reversible transform that converts a string into another string . The size of the run-length encoded BWT (RLBWT) can b…