Succinct Data Structure Library 3.0
☆112Nov 2, 2026Updated this week
Alternatives and similar repositories for sdsl-lite
Users that are interested in sdsl-lite are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 10 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Wavelet tree based on a fixed block boosting technique☆17May 18, 2021Updated 5 years ago
- Succinct Data Structure Library 2.0☆2,311Jun 2, 2023Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- A tool for merging large BWTs☆23Nov 26, 2020Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Paper Collection for Stringologists☆17Oct 30, 2026Updated last week
- An optimal space run-length Burrows-Wheeler transform full-text index☆72May 31, 2023Updated 3 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A new lossless data compression algorithm☆12Sep 9, 2026Updated last month
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated 2 years ago
- String Visualizer☆13Sep 12, 2026Updated last month
- Efficient, parallel compression for terabyte-scale data☆65Feb 25, 2026Updated 8 months ago
- Efficient construction of the BWT using string compression☆25May 26, 2026Updated 5 months ago
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆20Jun 23, 2025Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆55Apr 19, 2024Updated 2 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆20Nov 1, 2023Updated 3 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆46Mar 9, 2026Updated 7 months ago
- LZ Double factor Factorization.☆11Feb 26, 2017Updated 9 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- A Rust interface for the Succinct Data Structure Library.☆15Jan 24, 2022Updated 4 years ago
- Simple succinct data structures (in Rust)☆56Sep 14, 2026Updated last month
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated 2 years ago
- Method to measure the amount of allocated memory of a program at run-time.☆72Apr 4, 2022Updated 4 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- A simple C++11 memory monitor☆14Dec 17, 2015Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- A collection of succinct data structures☆219Jan 3, 2024Updated 2 years ago
- ☆14Jan 31, 2020Updated 6 years ago
- kmer-counter☆19Updated this week