19 citations · 19 across the 11 of their papers we have counts for
4 papers · 1 filter
Sensitivity of string compressors and repetitiveness measures
Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
The sensitivity of a string compression algorithm asks how much the output size for an input string can increase when a single character edit operation is performed…
On the approximation ratio of LZ-End to LZ77
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi +3
A family of Lempel-Ziv factorizations is a well-studied string structure. The LZ-End factorization is a member of the family that achieved faster extraction of any substrings (Kref…
Minimal unique palindromic substrings after single-character substitution
Mitsuru Funakoshi, Takuya Mieno
A palindrome is a string that reads the same forward and backward. A palindromic substring of a string is called a minimal unique palindromic substring (MUPS) of if …
A Separation of and via Thue--Morse Words
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I +3
We prove that for , the size of the smallest bidirectional scheme for the th Thue--Morse word is . Since Kutsukake et al. [SPIRE 2020] show that the…