I. Tomohiro

collaborators

2 papers

cs.DM2026

Another Way to Lower the Bound for Distinct Squares

Eitatsu Tomita, Tomohiro I

A square is a word of the form $xx$ for a non-empty word $x$ . Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n…

cs.DS2025

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies

Kotaro Kimura, Tomohiro I

Nishimoto and Tabei [CPM, 2021] proposed r-enum, an algorithm to enumerate various characteristic substrings, including maximal repeats, in a string $T$ of length $n$ in $O (r)$ wor…