Mapping sequencing data to De Bruijn graphs, fast
☆37Jul 10, 2026Updated 2 weeks ago
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 4 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆57Mar 13, 2025Updated last year
- ☆17Jan 6, 2025Updated last year
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Compacted and colored de Bruijn graph construction and querying☆99Jul 1, 2026Updated 3 weeks ago
- 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 week
- 🐟 🔬🦀 alevin-fry is an efficient and flexible tool for processing single-cell sequencing data, currently focused on single-cell transc…☆213Jul 10, 2026Updated 2 weeks ago
- 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 3 weeks ago
- kmer-counter based on kache-hash☆16Updated this week
- lace up GFA files using panSN path name sub-ranges to coordinate the lacing☆14Jul 30, 2025Updated 11 months 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.
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆45Mar 9, 2026Updated 4 months ago
- Tearing through FASTA/Q sequences☆38Jul 9, 2026Updated 2 weeks ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆95Jul 15, 2026Updated last week
- ☆27Jun 16, 2026Updated last month
- ☆57Aug 11, 2022Updated 3 years ago
- Parallel Construction of Suffix Arrays in Rust☆26May 2, 2025Updated last year
- Single-cache-miss rank queries over size 2 and 4 alphabets. 2x faster than all other Rust crates.☆15Apr 1, 2026Updated 3 months ago
- ☆21Dec 26, 2025Updated 6 months ago
- ☆15May 22, 2026Updated 2 months ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Bidirectional WFA (Paper)☆49May 20, 2024Updated 2 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆47May 13, 2026Updated 2 months ago
- Rust bindings to minimap2 library☆113May 3, 2026Updated 2 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 7 months ago
- A SIMD-accelerated library to compute random minimizers☆46Jul 7, 2026Updated 2 weeks ago
- 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 and UltraLogLog☆22Jan 22, 2026Updated 6 months ago
- Differential k-mer analysis☆42Jan 29, 2024Updated 2 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.
- 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 2 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 11 months ago
- The fastest priority queue☆30Jul 7, 2026Updated 2 weeks ago
- MERFISHTools implement a Bayesian framework for accurately predicting gene or transcript expression from MERFISH data. On top, they provi…☆14Aug 9, 2019Updated 6 years ago