106 citations · 138 across the 47 of their papers we have counts for
5 papers · 1 filter
Fast Computation of -Runs, Parameterized Squares, and Other Generalised Squares
Yuto Nakashima, Jakub Radoszewski, Tomasz Waleń
A -mismatch square is a string of the form where and are two equal-length strings that have at most mismatches. Kolpakov and Kucherov [Theor. Comput. Sci., 2003…
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 Additive Sensitivity on LZ-style Compressors and String Attractors
Yuto Fujie, Hiroki Shibata, Yuto Nakashima +1
The worst-case additive sensitivity of a string repetitiveness measure is defined to be the largest difference between and , where is a string of length a…
Counting Distinct (Non-)Crossing Substrings in Optimal Time
Haruki Umezaki, Hiroki Shibata, Dominik Köppl +3
Let be a string of length . The problem of counting factors crossing a position -- Problem 64 from the textbook ``125 Problems in Text Algorithms'' [Crochemore, Lecroq, and…
LZBE: an LZ-style compressor supporting -time random access
Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi +1
An LZ-like factorization of a string divides it into factors, each being either a single character or a copy of a preceding substring. While grammar-based compression schemes suppo…