gvinciguerra / la_vectorView external linksLinks
🔶 Compressed bitvector/container supporting efficient random access and rank queries
☆46Sep 4, 2024Updated last year
Alternatives and similar repositories for la_vector
Users that are interested in la_vector are comparing it to the libraries listed below
Sorting:
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 10 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated 11 months ago
- ☆12Jul 15, 2025Updated 6 months ago
- ☆11Feb 21, 2023Updated 2 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 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
- Comparing and combining multiple metagenomic datasets☆16Oct 12, 2022Updated 3 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Dynamic succinct/compressed data structures☆115Dec 17, 2025Updated last month
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- 🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of item…☆865Nov 28, 2024Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Sep 19, 2019Updated 6 years ago
- ☆28Sep 28, 2022Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆13Dec 9, 2024Updated last year
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 10 months ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Jan 25, 2021Updated 5 years ago
- ☆24Apr 2, 2021Updated 4 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Nov 27, 2019Updated 6 years ago
- Persistent Bloom Filter☆12Jul 21, 2018Updated 7 years ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- Bicriteria Data Compressor☆14Dec 9, 2017Updated 8 years ago
- CHR2 to SQL conversion☆15Aug 27, 2015Updated 10 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 8 years ago
- Succinct data structures in C/C++☆93Oct 7, 2024Updated last year
- Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.☆34Sep 6, 2023Updated 2 years ago
- Succinct Data Structure Library 3.0☆102Dec 15, 2025Updated 2 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago