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
Sorting:
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated 2 years ago
- 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☆97Apr 15, 2023Updated 2 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 3 years ago
- LOUDS-trie implementation example (C++)☆14Nov 27, 2019Updated 6 years ago
- A simple C++11 memory monitor☆15Dec 17, 2015Updated 10 years ago
- DeeNA Zip (SAM/BAM compression tool)☆13May 25, 2019Updated 6 years ago
- A tool that generates a data structure from a schema and some relational queries, using modern database techniques to make queries highly…☆10Jul 25, 2021Updated 4 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)☆27May 29, 2023Updated 2 years ago
- A lightweight suffix-sorting library☆402Mar 25, 2020Updated 5 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
- 📝 Easily convert Digital Object Identifier (DOI) and Uniform Resource Locator (URL) to BibTeX and DOI to plain text.☆38Apr 28, 2023Updated 2 years ago
- Reduced on-disk Suffix Array☆22Oct 9, 2013Updated 12 years ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 3 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- ☆18Aug 31, 2022Updated 3 years ago
- Ranking Entity Types using the Web of Data☆30Nov 22, 2016Updated 9 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- Succinct Data Structure Library 3.0☆104Dec 15, 2025Updated 3 months ago
- ☆10Feb 23, 2024Updated 2 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆24Mar 14, 2026Updated last week
- Lock-free multithreaded memory allocation☆111Dec 14, 2016Updated 9 years ago
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Nov 17, 2019Updated 6 years ago
- Timing attack resistant type systems☆24May 13, 2015Updated 10 years ago
- Library that provides an actor style message-passing programming model (in C++).☆23Sep 1, 2015Updated 10 years ago
- 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,299Jun 2, 2023Updated 2 years ago
- ☆16Jun 22, 2023Updated 2 years ago