2 citations · 3 across the 2 of their papers we have counts for
5 papers
Load-Balancing Succinct B Trees
Tomohiro I, Dominik Köppl
We propose a B tree representation storing keys, each of bits, in either (a) bits or (b) bits of space supporting all B t…
PHONI: Streamed Matching Statistics with Multi-Genome References
Christina Boucher, Travis Gagie, Tomohiro I +6
Computing the matching statistics of patterns with respect to a text is a fundamental task in bioinformatics, but a formidable one when the text is a highly compressed genomic data…
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…
Block Palindromes: A New Generalization of Palindromes
Keisuke Goto, Tomohiro I, Hideo Bannai +1
We study a new generalization of palindromes and gapped palindromes called block palindromes. A block palindrome is a string that becomes a palindrome when identical substrings are…
Computing convolution on grammar-compressed text
Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga +2
The convolution between a text string of length and a pattern string of length can be computed in time by FFT. It is known that various types of appro…