Succinct Data Structure Library
☆112Sep 26, 2013Updated 13 years ago
Alternatives and similar repositories for sdsl
Users that are interested in sdsl are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Succinct Data Structure Library 2.0☆2,309Jun 2, 2023Updated 3 years ago
- Reduced on-disk Suffix Array☆22Oct 9, 2013Updated 13 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 12 years ago
- A collection of succinct data structures☆219Jan 3, 2024Updated 2 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 10 months ago
- direct accessible compressed vector☆11Jun 25, 2011Updated 15 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆112Jan 22, 2015Updated 11 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Jun 27, 2023Updated 3 years ago
- FM-index is the fastest full text search algorithm using a compressed index file. This is FM-index for JSX/JS/AMD/Common.js.☆11Nov 9, 2013Updated 12 years ago
- A lightweight suffix-sorting library☆418Mar 25, 2020Updated 6 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- A tool for merging large BWTs☆23Nov 26, 2020Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated 2 years ago
- snippets of what's new in the c++14 standard☆30Sep 17, 2014Updated 12 years ago
- Compact Data Structures Library☆102Jun 20, 2022Updated 4 years ago
- TU DOrtmund lossless COMPression framework☆20Sep 7, 2024Updated 2 years ago
- A word-aligned integer compression algorithm.☆13Jul 8, 2024Updated 2 years ago
- Succinct Data Structure Library Collection.Includes bit-vector/wavelet-matrix/trie.☆13Jul 16, 2015Updated 11 years ago
- Ultra fast MSD radix sorter☆10Jun 23, 2020Updated 6 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆53Aug 12, 2019Updated 7 years ago
- A suffix-tree index implemented in go☆10Oct 11, 2019Updated 7 years ago
- Aerie: a regex-like engine nested word grammars☆16Feb 5, 2022Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- Succinct Data Structure Library 3.0☆111Oct 14, 2026Updated 2 weeks ago
- General purpose C++ library for iZENECloud☆43Apr 21, 2015Updated 11 years ago
- Binary sequence compression providing constant time rank and logarithmic time select in nH_o(B) + o(n) bits.☆14Oct 27, 2013Updated 13 years ago
- de Bruijn CompAction in Low Memory☆23Jan 15, 2016Updated 10 years ago
- store-d lets you easily combine standard SQL servers to create a distributed schema-less JSON store that uses native SQL.☆18Oct 26, 2017Updated 9 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- A simple Haskell OAuth2 library☆18Jul 15, 2022Updated 4 years ago
- String B-tree implementation that is faithful to theoretical result of Ferragina and Grossi of 96/99☆11Jul 9, 2012Updated 14 years ago
- PostScript programming in the Coq proof assistant☆13Jun 12, 2014Updated 12 years ago
- BitMagic Library☆456Oct 18, 2026Updated last week
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- SeqOthello supports fast coverage query and containment query.☆12May 8, 2019Updated 7 years ago