y-256 / libdivsufsortLinks
A lightweight suffix-sorting library
☆388Updated 5 years ago
Alternatives and similar repositories for libdivsufsort
Users that are interested in libdivsufsort are comparing it to the libraries listed below
Sorting:
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆216Updated last week
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Succinct Data Structure Library 3.0☆94Updated this week
- Dynamic succinct/compressed data structures☆112Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- BitMagic Library☆426Updated 4 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Parallel Lightweight Suffix Array Algorithm.☆18Updated 8 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Fast integer compression in C using the StreamVByte codec☆407Updated 6 months ago
- ☆144Updated last year
- Succinct Data Structure Library☆107Updated 11 years ago
- C library implementing the ridiculously fast CLHash hashing function☆280Updated last year
- Rolling Hash C++ Library☆187Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- A simple C library for compressing lists of integers using binary packing☆505Updated 2 years ago
- Implementation of the sacabench framework☆17Updated 4 years ago
- Compression Benchmark☆354Updated 2 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆323Updated 9 months ago
- A collection of succinct data structures☆207Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆437Updated last month
- 🚀 Fast C/C++ bit population count library☆348Updated last year
- Compact Data Structures Library☆128Updated 10 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆346Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 7 months ago
- linear time suffix array construction algorithm