Mapping sequencing data to De Bruijn graphs, fast
☆37Aug 11, 2026Updated this week
Alternatives and similar repositories for piscem
Users that are interested in piscem are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- ☆15Nov 30, 2023Updated 2 years ago
- A small, auxiliary index to massively improve parallel fastq parsing☆32Mar 6, 2026Updated 5 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆57Mar 13, 2025Updated last year
- ☆17Jan 6, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Compacted and colored de Bruijn graph construction and querying☆99Jul 1, 2026Updated last month
- Tools for working FASTQ files from sequencers (R1/R2/I1/I2)☆12Dec 6, 2024Updated last year
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated last month
- 🐟 🔬🦀 alevin-fry is an efficient and flexible tool for processing single-cell sequencing data, currently focused on single-cell transc…☆214Updated this week
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Differential expression and allelic analysis, nonparametric statistics☆32Jan 3, 2025Updated last year
- BAM/SAM/CRAM/FASTA reader, pileup engine, BCF/BAM writing☆27Jun 25, 2026Updated last month
- kmer-counter based on kache-hash☆16Jul 30, 2026Updated 2 weeks ago
- lace up GFA files using panSN path name sub-ranges to coordinate the lacing☆14Jul 30, 2025Updated last year
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆45Mar 9, 2026Updated 5 months ago
- Tearing through FASTA/Q sequences☆38Jul 9, 2026Updated last month
- Building the compacted de Bruijn graph efficiently from references or reads.☆95Updated this week
- ☆27Jun 16, 2026Updated last month
- ☆58Aug 11, 2022Updated 4 years ago
- Parallel Construction of Suffix Arrays in Rust☆26Updated this week
- Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.☆15Apr 1, 2026Updated 4 months ago
- ☆21Dec 26, 2025Updated 7 months ago
- ☆15May 22, 2026Updated 2 months ago
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- Bidirectional WFA (Paper)☆50May 20, 2024Updated 2 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆47May 13, 2026Updated 3 months ago
- Rust bindings to minimap2 library☆113May 3, 2026Updated 3 months ago
- Long read aligner for cyclic and acyclic pangenome graphs☆41Dec 20, 2023Updated 2 years ago
- A minimap2 implementation with binseq inputs☆18Dec 11, 2025Updated 8 months ago
- A SIMD-accelerated library to compute random minimizers☆46Jul 7, 2026Updated last month
- R integration for edlib, a C/C++ library for pairwise sequence alignment using edit distance (Levenshtein distance).☆11Jul 20, 2025Updated last year
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆22Jul 29, 2026Updated 2 weeks ago
- Differential k-mer analysis☆42Jan 29, 2024Updated 2 years ago
- 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.
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆20Jun 23, 2025Updated last year
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆40May 4, 2026Updated 3 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Extracts subgraphs or components from a graph in GFA format☆24Nov 18, 2024Updated last year
- ☆17Aug 8, 2025Updated last year
- The fastest priority queue☆30Jul 7, 2026Updated last month
- MERFISHTools implement a Bayesian framework for accurately predicting gene or transcript expression from MERFISH data. On top, they provi…☆14Aug 9, 2019Updated 7 years ago