Takuya Mieno

activity

20162026

most citedTight bounds on the maximum number of shortest unique substrings

2 citations · 6 across the 31 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Linear-time computation of generalized minimal absent words for multiple strings

Kouta Okabe, Takuya Mieno, Yuto Nakashima +2

A string $w$ is called a minimal absent word (MAW) for a string $S$ if $w$ does not occur as a substring in $S$ and all proper substrings of $w$ occur in $S$ . MAWs are well-studied…

cs.DS2023★ 1 cited

Sliding suffix trees revisited

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai +1

The sliding suffix tree (Fiala \& Greene, 1989) is a suffix tree that is maintained for a sliding window $W_{i} = T [i .. i + d - 1]$ of size $d$ that shifts over an input text $T$ of lengt…