11 citations · 20 across the 20 of their papers we have counts for
4 papers · 1 filter
Computing NP-hard Repetitiveness Measures via MAX-SAT
Hideo Bannai, Keisuke Goto, Masakazu Ishihata +3
Repetitiveness measures reveal profound characteristics of datasets, and give rise to compressed data structures and algorithms working in compressed space. Alas, the computation o…
Computing the Parameterized Burrows--Wheeler Transform Online
Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl +2
Parameterized strings are a generalization of strings in that their characters are drawn from two different alphabets, where one is considered to be the alphabet of static characte…
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…