Compact Data Structures Library
☆102Jun 20, 2022Updated 3 years ago
Alternatives and similar repositories for libcds2
Users that are interested in libcds2 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Compact Data Structures Library☆129Sep 4, 2014Updated 11 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 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
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- A word-aligned integer compression algorithm.☆13Jul 8, 2024Updated last year
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 7 years ago
- BEETL☆98Apr 15, 2023Updated 3 years ago
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 years ago
- DeeNA Zip (SAM/BAM compression tool)☆13May 25, 2019Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- A library of inverted index data structures☆150Dec 15, 2022Updated 3 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)☆27May 29, 2023Updated 2 years ago
- A lightweight suffix-sorting library☆407Mar 25, 2020Updated 6 years ago
- Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]☆17Aug 9, 2021Updated 4 years ago
- BWT-based index for graphs☆73Mar 12, 2025Updated last year
- FM-index representation of a de Bruijn graph☆26Aug 7, 2017Updated 8 years ago
- 📝 Easily convert Digital Object Identifier (DOI) and Uniform Resource Locator (URL) to BibTeX and DOI to plain text.☆38Apr 28, 2023Updated 3 years ago
- Reduced on-disk Suffix Array☆22Oct 9, 2013Updated 12 years ago
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 5 months ago
- ☆18Aug 31, 2022Updated 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 tool for merging large BWTs☆23Nov 26, 2020Updated 5 years ago
- Succinct Data Structure Library 3.0☆105Apr 27, 2026Updated 3 weeks ago
- ☆10Feb 23, 2024Updated 2 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆35Apr 1, 2026Updated last month
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Nov 17, 2019Updated 6 years ago
- Better code coverage tool for JavaScript.☆89May 21, 2020Updated 5 years ago
- Timing attack resistant type systems☆24May 13, 2015Updated 11 years ago
- Library that provides an actor style message-passing programming model (in C++).☆23Sep 1, 2015Updated 10 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- MAW: a suite on the computation and application of Minimal Absent Words☆16Nov 1, 2021Updated 4 years ago
- sliding fast fourier transform using haskell streaming☆13Feb 19, 2019Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- Succinct Data Structure Library 2.0☆2,301Jun 2, 2023Updated 2 years ago
- Protect against backwards-incompatible serializations☆23May 21, 2021Updated 4 years ago
- GHCJS FFI bindings to the Electron API (WIP).☆10May 21, 2017Updated 8 years ago
- GHC patched with the -fcompact-holes flag☆11Nov 12, 2018Updated 7 years ago