research
∙
07/06/2022
Computing NP-hard Repetitiveness Measures via MAX-SAT
Repetitiveness measures reveal profound characteristics of datasets, and...
share
research
∙
02/16/2022
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space
The compression of highly repetitive strings (i.e., strings with many re...
research
∙
04/19/2021
A Separation of γ and b via Thue–Morse Words
We prove that for n≥ 2, the size b(t_n) of the smallest bidirectional sc...
research
∙
06/09/2020
Optimal-Time Queries on BWT-runs Compressed Indexes
Although a significant number of compressed indexes for highly repetitiv...
research
∙
06/09/2020
Faster Queries on BWT-runs Compressed Indexes
Although a significant number of compressed indexes for highly repetitiv...
research
∙
04/03/2020
Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space
Lcp-values, lcp-intervals, and maximal repeats are powerful tools in var...
research
∙
02/14/2019
Conversion from RLBWT to LZ77
Converting a compressed format of a string into another compressed forma...
research
∙
12/11/2018
LZRR: LZ77 Parsing with Right Reference
Lossless data compression has been widely studied in computer science. O...
research
∙
11/08/2017
