38 citations · 64 across the 26 of their papers we have counts for
6 papers · 1 filter
In-Place Bijective Burrows-Wheeler Transforms
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian +1
One of the most well-known variants of the Burrows-Wheeler transform (BWT) [Burrows and Wheeler, 1994] is the bijective BWT (BBWT) [Gil and Scott, arXiv 2012], which applies the ex…
Grammar compression with probabilistic context-free grammar
Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka +2
We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string has been compressed as a context-free gramma…
Detecting -(Sub-)Cadences and Equidistant Subsequence Occurrences
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga +3
The equidistant subsequence pattern matching problem is considered. Given a pattern string and a text string , we say that is an \emph{equidistant subsequence} of if…
Fast and linear-time string matching algorithms based on the distances of -gram occurrences
Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka +1
Given a text of length and a pattern of length , the string matching problem is a task to find all occurrences of in . In this study, we propose an algorithm…
Parameterized DAWGs: efficient constructions and bidirectional pattern searches
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian +6
Two strings and over of equal length are said to \emph{parameterized match} (\emph{p-match}) if there is a renaming bijection that…
Computing Covers under Substring Consistent Equivalence Relations
Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka +1
Covers are a kind of quasiperiodicity in strings. A string is a cover of another string if any position of is inside some occurrence of in . The shortest and lon…