research
∙
01/07/2022
The Efficiency of the ANS Entropy Encoding
The Asymmetric Numeral Systems (ANS) is a class of entropy encoders by D...
share
research
∙
06/03/2021
Internal Shortest Absent Word Queries in Constant Time and Linear Space
Given a string T of length n over an alphabet Σ⊂{1,2,…,n^O(1)} of size σ...
research
∙
05/08/2021
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
The notions of synchronizing and partitioning sets are recently introduc...
research
∙
02/28/2021
Weighted Ancestors in Suffix Trees Revisited
The weighted ancestor problem is a well-known generalization of the pred...
research
∙
01/15/2020
Optimal Skeleton Huffman Trees Revisited
A skeleton Huffman tree is a Huffman tree in which all disjoint maximal ...
research
∙
03/05/2019
Lempel-Ziv-like Parsing in Small Space
Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widel...
research
∙
11/03/2018
Compressed Multiple Pattern Matching
Given d strings over the alphabet {0,1,...,σ-1}, the classical Aho--Cora...
research
∙
05/09/2018
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time
Given a threshold L and a set R = {R_1, ..., R_m} of m haplotype sequenc...
research
∙
11/08/2017
