Succinct data structures using very efficient rank and select
☆134Aug 10, 2026Updated 2 months ago
Alternatives and similar repositories for vers
Users that are interested in vers are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Collection of succinct data structures in Rust☆108Aug 31, 2026Updated last month
- FM-index for Rust☆25Jun 29, 2026Updated 3 months ago
- A Rust implementation of the Quad Wavelet Tree☆58Jul 8, 2026Updated 3 months ago
- Rust implementations of succinct data structures☆80Updated this week
- Rust implementation of the Haskell Rampart library that determines how intervals relate to each other.☆11Apr 21, 2022Updated 4 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.
- ☆17Jan 6, 2023Updated 3 years ago
- Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.☆18Apr 1, 2026Updated 6 months ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆43Jul 23, 2026Updated 2 months ago
- Rust libraries and programs focused on succinct data structures☆173Updated this week
- A rust wrapper for the spoa C++ partial order alignment library☆10Jun 11, 2025Updated last year
- A Rust port of the WebGraph framework☆63Jul 23, 2026Updated 2 months ago
- PtrHash minimal perfect hash function☆106Sep 27, 2026Updated last week
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated 2 months ago
- ☆21Dec 26, 2025Updated 9 months ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Iterate over minimizers of a DNA sequence☆33Jul 12, 2024Updated 2 years ago
- ☆368Sep 8, 2026Updated last month
- Base 32 + 64 encoding and decoding identifiers + bytes in rust, quickly☆17Oct 10, 2025Updated 11 months ago
- String algorithm visualizations☆14Feb 7, 2023Updated 3 years ago
- The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.☆359Updated this week
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- A Rust library that provides space-efficient, in-memory representations for integer vectors. It offers two complementary data structures:…☆37Mar 30, 2026Updated 6 months ago
- Rust port of Spice, a low-overhead parallelization library☆721May 5, 2025Updated last year
- Simple and transparent support for compressed files.☆81Sep 23, 2026Updated 2 weeks 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.
- BAM/SAM/CRAM/FASTA reader, pileup engine, BCF/BAM writing☆29Updated this week
- Integer types with customizable niche values☆51Nov 18, 2024Updated last year
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14May 29, 2026Updated 4 months ago
- 📈 The fastest (for very small maps!) alternative of Rust HashMap, which doesn't use hashing and doesn't use heap (aka "linear map")☆220Updated this week
- Database-like Asset management on top of ECS storage☆16Aug 22, 2026Updated last month
- Integer sets as fast, sorted, integer ranges with full set operations☆114Sep 28, 2026Updated last week
- A Rust library for storing generic genomic data by sorted chromosome name☆18Sep 26, 2024Updated 2 years ago
- Fast non-cryptographic hash, with the benchmarks to prove it.☆21Jun 19, 2023Updated 3 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆22Updated this week
- 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 pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆120Sep 9, 2026Updated last month
- High performance FID (Fully Indexable Dictionary) library☆26Jul 19, 2024Updated 2 years ago
- A Rust implementation of SSHash☆20Aug 30, 2026Updated last month
- Out-of-memory sorting of large datasets map / reduce style processing☆48May 14, 2026Updated 4 months ago
- B-field implementation in Rust☆204Jun 24, 2025Updated last year
- Concurrency algorithms☆13Apr 7, 2025Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆46Mar 9, 2026Updated 7 months ago