19 citations · 59 across the 13 of their papers we have counts for
12 papers · 1 filter
Practical Random Access to SLP-Compressed Texts
Travis Gagie, Tomohiro I, Giovanni Manzini +4
Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construct…
Rpair: Rescaling RePair with Rsync
Travis Gagie, Tomohiro I, Giovanni Manzini +3
Data compression is a powerful tool for managing massive but repetitive datasets, especially schemes such as grammar-based compression that support computation over the data withou…
RePair in Compressed Space and Time
Kensuke Sakai, Tatsuya Ohno, Keisuke Goto +3
Given a string of length , the goal of grammar compression is to construct a small context-free grammar generating only . Among existing grammar compression methods, RePa…
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform
Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I +1
Run-length encoding Burrows-Wheeler Transformed strings, resulting in Run-Length BWT (RLBWT), is a powerful tool for processing highly repetitive strings. We propose a new algorith…
Online Grammar Compression for Frequent Pattern Discovery
Shouhei Fukunaga, Yoshimasa Takabatake, I Tomohiro +1
Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar…
siEDM: an efficient string index and search algorithm for edit distance with moves
Yoshimasa Takabatake, Kenta Nakashima, Tetsuji Kuboyama +2
Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge. Edit distance with…