🔶 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆32Apr 1, 2025Updated last year
- ☆11Feb 21, 2023Updated 3 years ago
- ☆12Jul 15, 2025Updated 11 months ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 2 months ago
- Comparing and combining multiple metagenomic datasets☆16Oct 12, 2022Updated 3 years ago
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 6 months ago
- 🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of item…☆873Nov 28, 2024Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆69May 31, 2023Updated 3 years ago
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 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.
- Succinct Data Structure Library 3.0☆107Jun 22, 2026Updated 2 weeks ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 11 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- Efficient construction of the BWT using string compression☆22May 26, 2026Updated last month
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆89Jan 25, 2024Updated 2 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 5 years ago
- ☆24Apr 2, 2021Updated 5 years ago
- ☆28Sep 28, 2022Updated 3 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 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
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Library for the Handle Graph abstraction☆25Jan 15, 2026Updated 5 months ago
- Persistent Bloom Filter☆12Jul 21, 2018Updated 7 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 9 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.
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Nov 27, 2019Updated 6 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- A SIMD-accelerated library to compute random minimizers☆46Apr 6, 2026Updated 3 months ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Feb 23, 2023Updated 3 years ago
- a string to graph aligner☆41Jul 5, 2016Updated 10 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆104May 6, 2026Updated 2 months ago