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