1 citations · 2 across the 4 of their papers we have counts for
6 papers
Longest (Sub-)Periodic Subsequence
Hideo Bannai, Tomohiro I, Dominik Köppl
We present an algorithm computing the longest periodic subsequence of a string of length in time with words of space. We obtain improvements when restricting…
Computing Longest (Common) Lyndon Subsequences
Hideo Bannai, Tomohiro I, Tomasz Kociumaka +2
Given a string with length whose characters are drawn from an ordered alphabet of size , its longest Lyndon subsequence is a longest subsequence of that is a Lyndon…
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…
Grammar-compressed Self-index with Lyndon Words
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima +3
We introduce a new class of straight-line programs (SLPs), named the Lyndon SLP, inspired by the Lyndon trees (Barcelo, 1990). Based on this SLP, we propose a self-index data struc…
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl +1
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT (BBWT) is a bijective variant of it.…
c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda +4
Given a dynamic set of strings of total length whose characters are drawn from an alphabet of size , a keyword dictionary is a data structure built on that provi…