research
∙
01/11/2023
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie
The suffix trees are fundamental data structures for various kinds of st...
share
research
∙
07/06/2022
Computing NP-hard Repetitiveness Measures via MAX-SAT
Repetitiveness measures reveal profound characteristics of datasets, and...
research
∙
04/17/2020
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification
Learning of interpretable classification models has been attracting much...
research
∙
08/14/2019
Re-Pair In-Place
Re-Pair is a grammar compression scheme with favorably good compression ...
research
∙
11/05/2018
RePair in Compressed Space and Time
Given a string T of length N, the goal of grammar compression is to cons...
research
∙
06/01/2018
Block Palindromes: A New Generalization of Palindromes
We propose a new generalization of palindromes and gapped palindromes ca...
research
∙
04/19/2018
