kg86 / lzdLinks
LZ Double factor Factorization.
☆11Updated 8 years ago
Alternatives and similar repositories for lzd
Users that are interested in lzd are comparing it to the libraries listed below
Sorting:
- TU DOrtmund lossless COMPression framework☆19Updated 10 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- A blend of the compact and sparse hash table implementations.☆15Updated 3 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- R-Index-F Library for Pattern Matching☆13Updated 11 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated this week
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Bicriteria Data Compressor☆14Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- Essential C++ utilities.☆15Updated last month
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Fast compressed trie dictionary library☆70Updated 9 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆37Updated 2 years ago