FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform
☆25Nov 20, 2025Updated 10 months ago
Alternatives and similar repositories for fmsi
Users that are interested in fmsi are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.☆18Apr 1, 2026Updated 6 months ago
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆20Oct 1, 2026Updated last week
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- A SIMD-accelerated library to compute random minimizers☆48Oct 2, 2026Updated last week
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 7 months ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- kmer-counter based on kache-hash☆19Updated this week
- A Rust library providing fully dynamic sets of k-mers with high locality☆47May 13, 2026Updated 4 months ago
- Minimum plain text representation of kmer sets☆20Jan 30, 2025Updated last year
- Taxonomy classification of viral sequences / contigs☆13Jul 15, 2025Updated last year
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14May 29, 2026Updated 4 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆21Aug 26, 2026Updated last month
- ☆21Feb 15, 2025Updated last year
- A minimal copy fastq and fasta reader built for parallel support and paired end processing☆50Sep 30, 2026Updated last week
- 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.
- Iterate over minimizers of a DNA sequence☆33Jul 12, 2024Updated 2 years ago
- Tearing through FASTA/Q sequences☆41Jul 9, 2026Updated 2 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆46Mar 9, 2026Updated 7 months ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆99Oct 1, 2026Updated last week
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Sep 18, 2026Updated 3 weeks ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆58Mar 13, 2025Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Computation of average nucleotide identity with the use of MMseqs2☆24Dec 11, 2024Updated last year
- 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.
- Approximate nearest neighbour search for microbial genomes based on hash metric☆66Sep 19, 2026Updated 2 weeks ago
- ☆17Apr 6, 2023Updated 3 years ago
- Map query sequences to the assemblies of all pre-June 2023 bacteria (https://ftp.ebi.ac.uk/pub/databases/AllTheBacteria/Releases/0.2/) on…☆12May 22, 2024Updated 2 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆22Updated this week
- Implementation of a Backpack Quotient Filter☆13Jun 24, 2026Updated 3 months ago
- Clustering tool optimized for sparse distance matrices: ~16M elements with ~190M connections clustered in minutes.☆16Sep 12, 2026Updated 3 weeks ago
- QuickEd is a high-performance exact sequence alignment based on the bound-and-align paradigm.☆31May 5, 2025Updated last year
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated 2 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Sep 3, 2026Updated last month
- 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.
- Compacted and colored de Bruijn graph construction and querying☆100Oct 1, 2026Updated last week
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57May 29, 2024Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆34Aug 17, 2022Updated 4 years ago
- Needleman-Wunsch Alignment in Go☆12Nov 9, 2020Updated 5 years ago
- ☆27Jun 16, 2026Updated 3 months ago
- Fast approximate string searching☆169Sep 27, 2026Updated last week
- String algorithm visualizations☆14Feb 7, 2023Updated 3 years ago