19 citations · 22 across the 4 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021★ 19 cited
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…
cs.DS2021★ 2 cited
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…
math.CO2021
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…