TNishimoto / lzrrLinks
A new lossless data compression algorithm
☆11Updated last month
Alternatives and similar repositories for lzrr
Users that are interested in lzrr are comparing it to the libraries listed below
Sorting:
- Paper Collection for Stringologists☆17Updated last week
- Compressed double-array tries for static string dictionaries☆11Updated 6 years ago
- Fast compressed trie dictionary library☆70Updated 11 months ago
- SUccinct Retrieval Framework☆21Updated 9 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A C++ library providing fast language model queries in compressed space.☆132Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆26Updated 5 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Bicriteria Data Compressor☆14Updated 7 years ago
- Static Huffman coding☆10Updated 8 years ago
- Essential C++ utilities.☆15Updated 3 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 5 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- A collection of succinct data structures☆209Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 4 months ago
- Compact Data Structures Library☆128Updated 11 years ago
- BWT tunneling☆12Updated 7 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- LittleBit is a pure Huffman coding compression algorithm with the option of random access reading while offering competitive compression …☆12Updated 4 years ago
- turn a directory into a GUI, slash example of VNC-based GUI☆32Updated 4 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- ☆28Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago