IlyaGrebnov / libsaisLinks
The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (LCP) array, permuted LCP (PLCP) array, Burrows-Wheeler transform (BWT) and inverse BWT based on the induced sorting algorithm with optional OpenMP support for multi-core parallel construction.
☆211Updated last month
Alternatives and similar repositories for libsais
Users that are interested in libsais are comparing it to the libraries listed below
Sorting:
- A lightweight suffix-sorting library☆386Updated 5 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆231Updated last month
- High performance block-sorting data compression library☆322Updated last month
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 years ago
- Header-only binary fuse and xor filter library☆369Updated 5 months ago
- Succinct Data Structure Library 3.0☆94Updated 2 months ago
- 🚀 Fast C/C++ bit population count library☆348Updated last year
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆32Updated 5 months ago
- libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.☆36Updated 2 months ago
- rANS coder (derived from https://github.com/rygorous/ryg_rans)☆83Updated 3 years ago
- Fast integer compression in C using the StreamVByte codec☆402Updated 5 months ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- BitMagic Library☆426Updated 3 months ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆53Updated 10 months ago
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 8 years ago
- A lightweight suffix-sorting library enhanced with LCP construction☆11Updated 5 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 5 months ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆320Updated 7 months ago
- String Matching Algorithms Research Tool☆103Updated last year
- Testing common random-number generators (RNG)☆185Updated 2 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆117Updated 4 years ago
- Dictionary compressor with nibbled ANS and optimal parsing. Other compression experiments.☆26Updated 2 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- Fast in-place radix sort with STL-like API☆47Updated 8 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆121Updated 5 months ago