GATB / bcalmLinks
compacted de Bruijn graph construction in low memory
☆100Updated 2 months 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☆65Updated 11 months ago
- An efficient index for the colored, compacted, de Bruijn graph☆111Updated last year
- Adaptive semi-global banded alignment on string graphs☆66Updated 7 years ago
- Estimating k-mer coverage histogram of genomics data☆77Updated 2 years ago
- A repository for generating strobemers and evalaution☆79Updated last year
- 🌈Scaffold genome sequence assemblies using linked or long read sequencing data☆95Updated last year
- Gfapy: a flexible and extensible software library for handling sequence graphs in Python☆71Updated 2 months ago
- De novo genome assembly and multisample variant calling☆112Updated 6 years ago
- Yet Another Chimeric Read Detector☆84Updated last year
- Assembled Genomes Compressor☆176Updated last year
- Histosketching Using Little Kmers☆56Updated 2 years ago
- abPOA: an SIMD-based C library for fast partial order alignment using adaptive band☆134Updated 3 months ago
- Pan-genome inference and genotyping with long noisy or short accurate reads☆119Updated last year
- Kmer-db is a fast and memory-efficient tool for large-scale k-mer analyses (indexing, querying, estimating evolutionary relationships, et…☆96Updated 8 months ago
- A EXPERIMENTAL fork of minimap2 optimized for assembly-to-reference alignment☆87Updated 4 years ago
- alignment to variation graph inducer☆156Updated last week
- Building the compacted de Bruijn graph efficiently from references or reads.☆92Updated this week
- Genome inference from a population reference graph☆96Updated 9 months ago
- ⛓ Long Interval Nucleotide K-mer Scaffolder☆73Updated 9 months ago
- Squeakr: An Exact and Approximate k -mer Counting System☆86Updated 11 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…☆67Updated 5 years ago
- ONT assembly and Illumina polishing pipeline☆88Updated 5 years ago
- BWT-based index for graphs☆73Updated 10 months ago
- BWT construction and search☆125Updated 2 weeks ago
- Substring index for paths in a graph☆60Updated last week
- Fast and accurate genomic distances using HyperLogLog☆163Updated 3 years ago
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆98Updated 3 years ago
- Peregrine: Fast Genome Assembler Using SHIMMER Index☆102Updated 3 years ago
- This is an updated mirror of the original PacBio Read Simulator☆39Updated 7 years ago
- Minia is a short-read assembler based on a de Bruijn graph☆76Updated last year