GATB / bcalmLinks
compacted de Bruijn graph construction in low memory
☆100Updated 2 weeks ago
Alternatives and similar repositories for bcalm
Users that are interested in bcalm are comparing it to the libraries listed below
Sorting:
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆64Updated 9 months ago
- alignment to variation graph inducer☆150Updated 2 weeks ago
- An efficient index for the colored, compacted, de Bruijn graph☆110Updated last year
- Substring index for paths in a graph☆60Updated this week
- De novo genome assembly and multisample variant calling☆112Updated 6 years ago
- Genome inference from a population reference graph☆96Updated 7 months ago
- Adaptive semi-global banded alignment on string graphs☆67Updated 7 years ago
- 🌈Scaffold genome sequence assemblies using linked or long read sequencing data☆95Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 8 months ago
- Estimating k-mer coverage histogram of genomics data☆76Updated last year
- Yet Another Chimeric Read Detector☆81Updated last year
- A repository for generating strobemers and evalaution☆79Updated last year
- A EXPERIMENTAL fork of minimap2 optimized for assembly-to-reference alignment☆87Updated 4 years ago
- Peregrine: Fast Genome Assembler Using SHIMMER Index☆102Updated 3 years ago
- abPOA: an SIMD-based C library for fast partial order alignment using adaptive band☆133Updated 3 weeks ago
- BWT construction and search☆120Updated 3 weeks ago
- ⛓ Long Interval Nucleotide K-mer Scaffolder☆74Updated 7 months ago
- Fast and accurate genomic distances using HyperLogLog☆162Updated 2 years ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆90Updated 6 months ago
- A genome assembler that reduces the computational time of human genome assembly from 400,000 CPU hours to 2,000 CPU hours, utilizing long…☆66Updated 5 years ago
- Gfapy: a flexible and extensible software library for handling sequence graphs in Python☆70Updated last week
- A fast K-mer counter for high-fidelity shotgun datasets☆134Updated 2 months ago
- BWT-based index for graphs☆73Updated 8 months ago
- Pangenome graphs (review article on graph-based pangenomic methods)☆72Updated 5 years ago
- ONT assembly and Illumina polishing pipeline☆89Updated 4 years ago
- Scrappie is a technology demonstrator for the Oxford Nanopore Research Algorithms group☆93Updated 3 years ago
- H.E.L.E.N. (Homopolymer Encoded Long-read Error-corrector for Nanopore)☆73Updated 5 years ago
- Hybrid error correction of long reads using colored de Bruijn graphs☆106Updated 2 months ago
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆98Updated 3 years ago
- A snakemake-based pipeline for assembling and polishing long genomes from long nanopore reads☆68Updated 4 years ago