philolo1 / bitvectorLinks
This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."
☆12Updated 8 years ago
Alternatives and similar repositories for bitvector
Users that are interested in bitvector are comparing it to the libraries listed below
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Compact Data Structures Library☆100Updated 2 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Relative data structures based on the BWT☆12Updated 7 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 …☆26Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Succinct C++☆24Updated 4 years ago
- Succinct Data Structure Library 3.0☆94Updated last month
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated 6 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Reproducing a bug in the Glibc condition variables using TLA+☆11Updated 2 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 3 weeks ago