Succinct Data Structure Library 3.0
☆103Dec 15, 2025Updated 2 months ago
Alternatives and similar repositories for sdsl-lite
Users that are interested in sdsl-lite are comparing it to the libraries listed below
Sorting:
- Dynamic succinct/compressed data structures☆116Dec 17, 2025Updated 2 months ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Efficient construction of the BWT using string compression☆21Jun 3, 2025Updated 9 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 4 months ago
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 3 weeks ago
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- ☆14Jan 31, 2020Updated 6 years ago
- Succinct Data Structure Library 2.0☆2,297Jun 2, 2023Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆36Jan 15, 2025Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 8 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 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
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- ☆24Apr 2, 2021Updated 4 years ago
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated last year
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 3 months ago
- Method to measure the amount of allocated memory of a program at run-time.☆70Apr 4, 2022Updated 3 years ago
- libForBES is a C++ solver for generic, constrained and possibly nonsmooth convex optimization problems. LASSO, optimal control, elastic n…☆10Apr 11, 2017Updated 8 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆110Jan 22, 2015Updated 11 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 months ago
- String Visualizer☆12Dec 18, 2025Updated 2 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- A simple C++11 memory monitor☆15Dec 17, 2015Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago