simongog / sdslLinks
Succinct Data Structure Library
☆107Updated 11 years ago
Alternatives and similar repositories for sdsl
Users that are interested in sdsl are comparing it to the libraries listed below
Sorting:
- Compact Data Structures Library☆101Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A collection of succinct data structures☆207Updated last year
- Compact Data Structures Library☆128Updated 10 years ago
- 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
- Succinct Data Structure Library 3.0☆94Updated this week
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- FOundation of stXXl and thriLL☆14Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Relative data structures based on the BWT☆12Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- BitMagic Library☆426Updated 4 months ago
- A collection of string sorting algorithms☆56Updated 3 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- A lightweight suffix-sorting library☆388Updated 5 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago