2 |
A theoretical and experimental analysis of BWT variants for string collections ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
String Rearrangement Inequalities and a Total Order Between Primitive Words ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Reduction ratio of the IS-algorithm: worst and random cases ...
|
|
|
|
BASE
|
|
Show details
|
|
11 |
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances ...
|
|
|
|
BASE
|
|
Show details
|
|
12 |
Space-Efficient Huffman Codes Revisited ...
|
|
|
|
Abstract:
Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encode or decode a symbol in constant worst case time. It uses $σ\lg \ell_{\text{max}} + o(σ) + O(\ell_{\text{max}}^2)$ bits of space, where $σ$ and $\ell_{\text{max}}$ are the alphabet size and maximum codeword length, respectively. We refine their representation to reduce the space complexity to $σ\lg \ell_{\text{max}} (1 + o(1))$ bits while preserving the constant encode and decode times. Our algorithmic idea can be applied to any canonical code. ...
|
|
Keyword:
Data Structures and Algorithms cs.DS; FOS Computer and information sciences; Information Theory cs.IT
|
|
URL: https://dx.doi.org/10.48550/arxiv.2108.05495 https://arxiv.org/abs/2108.05495
|
|
BASE
|
|
Hide details
|
|
13 |
A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals ...
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Lexicographically Fair Learning: Algorithms and Generalization ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ...
|
|
|
|
BASE
|
|
Show details
|
|
18 |
The Labeled Direct Product Optimally Solves String Problems on Graphs ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|