Takuya Mieno

activity

20162026

most citedTight bounds on the maximum number of shortest unique substrings

2 citations · 5 across the 26 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.DS2019

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window

Takuya Mieno, Yuki Kuhara, Tooru Akagi +5

A substring $u$ of a string $T$ is called a minimal unique substring (MUS) of $T$ if $u$ occurs exactly once in $T$ and any proper substring of $u$ occurs at least twice in $T$ . A…

cs.DS2019

Space-Efficient Algorithms for Computing Minimal/Shortest Unique Substrings

Takuya Mieno, Dominik Köppl, Yuto Nakashima +3

Given a string $T$ of length $n$ , a substring $u = T [i .. j]$ of $T$ is called a shortest unique substring (SUS) for an interval $[s, t]$ if (a) $u$ occurs exactly once in $T$ , (b) $u…