19 citations · 22 across the 4 of their papers we have counts for
5 papers
Minimal Absent Words on Run-Length Encoded Strings
Tooru Akagi, Kouta Okabe, Takuya Mieno +2
A string is called a minimal absent word (MAW) for another string if does not occur (as a substring) in and any proper substring of occurs in . State-of-the-…
Sensitivity of string compressors and repetitiveness measures
Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
The sensitivity of a string compression algorithm asks how much the output size for an input string can increase when a single character edit operation is performed…
Grammar Index By Induced Suffix Sorting
Tooru Akagi, Dominik Köppl, Yuto Nakashima +3
Pattern matching is the most central task for text indices. Most recent indices leverage compression techniques to make pattern matching feasible for massive but highly-compressibl…
Combinatorics of minimal absent words for a sliding window
Tooru Akagi, Yuki Kuhara, Takuya Mieno +4
A string is called a minimal absent word (MAW) for another string if does not occur in but the proper substrings of occur in . For example, let $Σ= \{\mathtt…
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
Takuya Mieno, Yuki Kuhara, Tooru Akagi +5
A substring of a string is called a minimal unique substring (MUS) of if occurs exactly once in and any proper substring of occurs at least twice in . A…