IlyaGrebnov / esa-matchfinderLinks
The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).
☆24Updated this week
Alternatives and similar repositories for esa-matchfinder
Users that are interested in esa-matchfinder are comparing it to the libraries listed below
Sorting:
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- Generic hash table library in C☆33Updated 3 months ago
- compact lzma decoder☆15Updated 5 years ago
- A collection of various algorithms to produce length-limited prefix codes☆24Updated 4 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆216Updated last week
- LittleBit is a pure Huffman coding compression algorithm with the option of random access reading while offering competitive compression …☆12Updated 4 years ago
- Bicriteria Data Compressor☆14Updated 7 years ago
- Algorithms that work on generic C arrays☆11Updated 8 years ago
- Fast and Strong Burrows Wheeler Model☆19Updated 6 years ago
- Dictionary compressor with nibbled ANS and optimal parsing. Other compression experiments.☆26Updated 4 months 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 last month
- Low memory multithreaded hash table☆24Updated 10 years ago
- Bit packed vector of integral values☆27Updated 6 months ago
- A minimal modern LZ compressor example☆59Updated 4 years ago
- libstrbuf: A powerful string library for C☆17Updated 8 years ago
- Fast deflate implementation with zopfli-like ratios and a streaming API☆28Updated 4 years ago
- experimental data compression algoritm☆22Updated 9 years ago
- Optimal LZ4 compression☆43Updated 5 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- FPC - Fast Prefix Coder☆30Updated 3 years ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- Experimental compression format (unmaintained, do not use!)☆32Updated 9 years ago
- ☆24Updated 4 months ago
- Example of LZ4 compression with optimal parsing using BriefLZ algorithms☆27Updated last year
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated last month
- Experimental parallel compression algorithm☆26Updated 7 years ago
- XWRT (XML-WRT) is an efficient XML/HTML/text compressor☆41Updated 8 years ago
- Popular hash table implementation benchmarks☆27Updated 8 years ago
- Example of CRUSH compression with optimal parsing using BriefLZ algorithms☆14Updated last year