Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
☆17Jun 23, 2025Updated 8 months ago
Alternatives and similar repositories for CaPS-SA
Users that are interested in CaPS-SA are comparing it to the libraries listed below
Sorting:
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Apr 24, 2025Updated 10 months ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Mar 13, 2025Updated 11 months ago
- String algorithm visualizations☆13Feb 7, 2023Updated 3 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- A Rust library for building modular, fast and compact indexes over genomic data☆12Nov 22, 2023Updated 2 years ago
- ☆16Apr 6, 2023Updated 2 years ago
- Bicriteria Data Compressor☆14Dec 9, 2017Updated 8 years ago
- Mapping sequencing data to De Bruijn graphs, fast☆30Updated this week
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Nov 18, 2023Updated 2 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆19Jan 22, 2026Updated last month
- ☆15Nov 30, 2023Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆31Jul 12, 2024Updated last year
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆20Sep 13, 2025Updated 5 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆50May 22, 2024Updated last year
- Parallel Construction of Suffix Arrays in Rust☆26May 2, 2025Updated 10 months ago
- Fast and exact gap-affine partial order alignment☆59Feb 3, 2026Updated last month
- Compacted and colored de Bruijn graph construction and querying☆92Updated this week
- PtrHash minimal perfect hash function☆88Sep 2, 2025Updated 6 months ago
- A Rust implementation of the Quad Wavelet Tree☆51Jan 31, 2026Updated last month
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- Bit packed vector of integral values☆29Jan 28, 2025Updated last year
- Rust library for processing sequencing reads.☆25Sep 2, 2024Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- A small, auxiliary index to massively improve parallel fastq parsing☆31Feb 12, 2026Updated 3 weeks ago
- Automatically generates conversions between an enum type and any other type☆11Jan 10, 2023Updated 3 years ago
- Fast Approximate Pattern Matching using Search Schemes☆16Jan 14, 2026Updated last month
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Jul 27, 2023Updated 2 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Feb 24, 2026Updated last week
- Simple succinct data structures (in Rust)☆54Feb 12, 2026Updated 3 weeks ago
- ☆24Apr 2, 2021Updated 4 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Apr 8, 2024Updated last year
- Collection of succinct data structures in Rust☆104Aug 1, 2025Updated 7 months ago
- Rust implementations of succinct data structures☆69Feb 18, 2026Updated 2 weeks ago
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14Aug 7, 2023Updated 2 years ago
- ☆14Feb 19, 2026Updated 2 weeks ago
- A SIMD-accelerated library to compute random minimizers☆39Updated this week
- ☆18May 10, 2023Updated 2 years ago