IlyaGrebnov / esa-matchfinderLinks
The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).
☆23Updated 3 months ago
Alternatives and similar repositories for esa-matchfinder
Users that are interested in esa-matchfinder are comparing it to the libraries listed below
Sorting:
- compact lzma decoder☆15Updated 5 years ago
- A collection of various algorithms to produce length-limited prefix codes☆24Updated 4 years ago
- Generic hash table library in C☆32Updated 2 months ago
- experimental data compression algoritm☆22Updated 9 years ago
- Dictionary compressor with nibbled ANS and optimal parsing. Other compression experiments.☆26Updated 3 months ago
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- Algorithms that work on generic C arrays☆11Updated 8 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆215Updated last month
- Experimental parallel compression algorithm☆26Updated 7 years ago
- Optimal LZ4 compression☆43Updated 5 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
- Experimental compression format (unmaintained, do not use!)☆32Updated 9 years ago
- Fast deflate implementation with zopfli-like ratios and a streaming API☆28Updated 4 years ago
- Optimal LZ4 compressor, that produces files that decompress faster while keeping the best compression ratio☆59Updated 2 years ago
- Custom compression for CRAM and others.☆35Updated 3 weeks ago
- A Loss-less data compression algorithm inspired by LZMA☆42Updated 8 years ago
- libstrbuf: A powerful string library for C☆17Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆54Updated 5 years ago
- A minimal modern LZ compressor example☆59Updated 4 years ago
- Low memory multithreaded hash table☆24Updated 10 years ago
- Example of LZ4 compression with optimal parsing using BriefLZ algorithms☆27Updated last year
- Fast and Strong Burrows Wheeler Model☆19Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- ☆24Updated 3 months ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math