FM-index for Rust
☆25Apr 30, 2025Updated 10 months ago
Alternatives and similar repositories for fm-index
Users that are interested in fm-index are comparing it to the libraries listed below
Sorting:
- Succinct data structures using very efficient rank and select☆131Feb 18, 2026Updated 2 weeks ago
- Parallel Construction of Suffix Arrays in Rust☆26May 2, 2025Updated 10 months ago
- Fast Approximate Pattern Matching using Search Schemes☆16Jan 14, 2026Updated last month
- A Linux-compatible operating system for x86☆11Updated this week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Iterate over minimizers of a DNA sequence☆31Jul 12, 2024Updated last year
- A d-ary heap in Rust☆21Sep 16, 2025Updated 5 months ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Nov 1, 2023Updated 2 years ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash and UltraLogLog☆19Jan 22, 2026Updated last month
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- A Rust implementation of the Quad Wavelet Tree☆51Jan 31, 2026Updated last month
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆24Nov 20, 2025Updated 3 months ago
- A Rust library for parsing, writing and manipulating Genbank sequence files☆22Apr 20, 2025Updated 10 months ago
- Collection of succinct data structures in Rust☆104Updated this week
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆110Jan 22, 2015Updated 11 years ago
- Rust implementations of succinct data structures☆69Updated this week
- Rust implementation of a fast, bounded, Zipf-distributed random number generator☆33Feb 8, 2025Updated last year
- A Similarity-Guided Alignment Algorithm☆28Feb 7, 2026Updated last month
- a simple read-only sequence database, designed for short reads☆20Dec 19, 2016Updated 9 years ago
- ☆31Mar 2, 2026Updated last week
- PtrHash minimal perfect hash function☆88Sep 2, 2025Updated 6 months ago
- Production-ready KV-backed HNSW implementation in Rust using LMDB☆71Updated this week
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Jan 22, 2026Updated last month
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- GFA parser in Rust☆30May 26, 2023Updated 2 years ago
- memflow I/O primitives☆82Apr 26, 2025Updated 10 months ago
- A SIMD-accelerated library to compute random minimizers☆39Mar 1, 2026Updated last week
- A Reproducible Untargeted Metabolomics Data Processing Pipeline☆11Mar 18, 2021Updated 4 years ago
- A streaming method for mapping nanopore raw signals☆32Nov 7, 2021Updated 4 years ago
- 翻訳前と後を並べて表示するChromeの拡張機能☆10Jul 1, 2014Updated 11 years ago
- Benchmarking pairwise aligners☆37Feb 8, 2025Updated last year
- A CUDA Library for Parallel n-body Integrations with focus on Simulations☆17Jul 2, 2014Updated 11 years ago
- Simple and transparent support for compressed files.☆81Feb 27, 2026Updated last week
- A library of common biomedical types.☆40Apr 14, 2025Updated 10 months ago
- A python library for creating simulated regulatory DNA sequences☆39Feb 22, 2023Updated 3 years ago
- FM-index is the fastest full text search algorithm using a compressed index file. This is FM-index for JSX/JS/AMD/Common.js.☆11Nov 9, 2013Updated 12 years ago
- ☆13Nov 15, 2017Updated 8 years ago
- Dynatrace FM-Index library☆15Nov 11, 2025Updated 3 months ago
- Introduction to Nanopore Sequencing - Prac material and presentations from The Omics Australia Tutorials Sydney (TOAST) workshop 19th - 2…☆10Jan 12, 2019Updated 7 years ago