Kouta Okabe

collaborators

Showing cs.DSShow 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.DS2022

Minimal Absent Words on Run-Length Encoded Strings

Tooru Akagi, Kouta Okabe, Takuya Mieno +2

A string $w$ is called a minimal absent word (MAW) for another string $T$ if $w$ does not occur (as a substring) in $T$ and any proper substring of $w$ occurs in $T$ . State-of-the-…