19 citations · 23 across the 7 of their papers we have counts for
10 papers
Bijective BWT based compression schemes
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that for any string , a bidirectional macro scheme of size can be induced from the…
LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation
Keita Nonaka, Kazutaka Yamanouchi, Tomohiro I +3
In this study, we propose a simple and effective preprocessing method for subword segmentation based on a data compression algorithm. Compression-based subword segmentation has rec…
Faster Privacy-Preserving Computation of Edit Distance with Moves
Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake +3
We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings and…
Re-Pair In Small Space
Dominik Köppl, Tomohiro I, Isamu Furuya +3
Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it…
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…
Improved Upper Bounds on all Maximal -gapped Repeats and Palindromes
Tomohiro I, Dominik Köppl
We show that the number of all maximal -gapped repeats and palindromes of a word of length is at most and , respectively.