Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
☆15Aug 7, 2018Updated 7 years ago
Alternatives and similar repositories for rankselect
Users that are interested in rankselect are comparing it to the libraries listed below
Sorting:
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Succinct Data Structure Library 3.0☆104Dec 15, 2025Updated 3 months ago
- String Visualizer☆12Dec 18, 2025Updated 3 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- A Trie data structure that allows for fuzzy string matching☆11May 24, 2015Updated 10 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Apr 26, 2022Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- Dremel DB Column Striping and Record Assembly Algorithms in Golang☆21Jul 11, 2013Updated 12 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Nov 1, 2023Updated 2 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Aug 28, 2020Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- BWT tunneling☆12Feb 4, 2018Updated 8 years ago
- Compact tries for fixed-width keys☆26Jun 4, 2018Updated 7 years ago
- Regular Expression Research☆12Jul 6, 2022Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 5 years ago
- Rust implementation of a fast, bounded, Zipf-distributed random number generator☆33Feb 8, 2025Updated last year
- ☆18Jul 9, 2018Updated 7 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Jan 22, 2023Updated 3 years ago
- C++11 library for fast fuzzy searching☆15Jun 9, 2015Updated 10 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- xoshiro256** random number generator☆22May 7, 2018Updated 7 years ago
- ☆24Aug 31, 2019Updated 6 years ago
- ☆10Feb 23, 2024Updated 2 years ago
- bit & sketches data structures☆60Nov 2, 2018Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- A small DFA for under 16 states☆54Jun 6, 2018Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆52Apr 19, 2024Updated last year
- linear time suffix array construction algorithm☆12Oct 28, 2016Updated 9 years ago
- Composable Data and Type Generators for C++☆10Mar 25, 2019Updated 6 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆86Mar 7, 2024Updated 2 years ago