T. I.

activity

20132024

most citedLCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation

19 citations · 23 across the 7 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

cs.DS2018★ 1 cited

RePair in Compressed Space and Time

Kensuke Sakai, Tatsuya Ohno, Keisuke Goto +3

Given a string $T$ of length $N$ , the goal of grammar compression is to construct a small context-free grammar generating only $T$ . Among existing grammar compression methods, RePa…

cs.FL2018

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 $n$ is at most $3 (π^{2} /6 + 5/2) α n$ and $7 (π^{2} /6 + 1/2) α n - 5 n - 1$ , respectively.

cs.DS2018

Refining the $r$ -index

Hideo Bannai, Travis Gagie, Tomohiro I

Gagie, Navarro and Prezza's $r$ -index (SODA, 2018) promises to speed up DNA alignment and variation calling by allowing us to index entire genomic databases, provided certain obsta…

RePair in Compressed Space and Time

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes

Refining the r-index

Improved Upper Bounds on all Maximal $α$ -gapped Repeats and Palindromes

Refining the $r$ -index