GATB / bcalmLinks
compacted de Bruijn graph construction in low memory
β100Updated 8 months ago
Alternatives and similar repositories for bcalm
Users that are interested in bcalm are comparing it to the libraries listed below
Sorting:
- πScaffold genome sequence assemblies using linked or long read sequencing dataβ94Updated 7 months ago
- Squeakr: An Exact and Approximate k -mer Counting Systemβ85Updated 4 months ago
- Core library of the Genome Analysis Toolbox with de-Bruijn graphβ63Updated 4 months ago
- Minia is a short-read assembler based on a de Bruijn graphβ74Updated 6 months ago
- Yet Another Chimeric Read Detectorβ80Updated 7 months ago
- Estimating k-mer coverage histogram of genomics dataβ77Updated last year
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.β51Updated last year
- De novo genome assembly and multisample variant callingβ112Updated 6 years ago
- A tool for Racon polishing of miniasm assembliesβ76Updated 3 weeks ago
- alignment to variation graph inducerβ148Updated 4 months ago
- A repository for generating strobemers and evalautionβ78Updated last year
- An efficient index for the colored, compacted, de Bruijn graphβ110Updated 8 months ago
- A snakemake-based pipeline for assembling and polishing long genomes from long nanopore readsβ69Updated 3 years ago
- Building the compacted de Bruijn graph efficiently from references or reads.β87Updated last month
- Kmer-db is a fast and memory-efficient tool for large-scale k-mer analyses (indexing, querying, estimating evolutionary relationships, etβ¦β91Updated last month
- GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/nβ¦β67Updated 2 years ago
- ONT assembly and Illumina polishing pipelineβ89Updated 4 years 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β¦β65Updated 4 years ago
- Pan-genome inference and genotyping with long noisy or short accurate readsβ117Updated 6 months ago
- Substring index for paths in a graphβ60Updated 2 months ago
- modular k-mer count matrix and Bloom filter construction for large read collectionsβ84Updated 8 months ago
- Hybrid error correction of long reads using colored de Bruijn graphsβ101Updated 9 months ago
- Parsnp was designed to align the core genome of hundreds to thousands of bacterial genomes within a few minutes to few hours. Input can bβ¦β144Updated last month
- A resistome profiler for Graphing Resistance Out Of meTagenomesβ66Updated 5 years ago
- BWT construction and searchβ115Updated 3 months ago
- Compacted and colored de Bruijn graph construction and queryingβ83Updated this week
- Antibiotic resistance predictions in minutes on a laptopβ50Updated 6 years ago
- A fast K-mer counter for high-fidelity shotgun datasetsβ131Updated 3 weeks ago
- A toolbox for pangenome analysis and threshold evaluation.β97Updated 2 years ago
- base-accurate DNA sequence alignments using WFA and mashmap3β191Updated 2 weeks ago