GATB / bcalmLinks
compacted de Bruijn graph construction in low memory
☆100Updated last month
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 10 months ago
- An efficient index for the colored, compacted, de Bruijn graph☆110Updated last year
- Substring index for paths in a graph☆60Updated last week
- Estimating k-mer coverage histogram of genomics data☆76Updated 2 years ago
- alignment to variation graph inducer☆152Updated this week
- BWT-based index for graphs☆73Updated 9 months ago
- A repository for generating strobemers and evalaution☆79Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 9 months ago
- Genome inference from a population reference graph☆96Updated 8 months ago
- This is an updated mirror of the original PacBio Read Simulator☆38Updated 7 years ago
- Adaptive semi-global banded alignment on string graphs☆67Updated 7 years ago
- De novo genome assembly and multisample variant calling☆112Updated 6 years ago
- Yet Another Chimeric Read Detector☆81Updated last year
- abPOA: an SIMD-based C library for fast partial order alignment using adaptive band☆134Updated last month
- Fast and accurate genomic distances using HyperLogLog☆162Updated 2 years ago
- A EXPERIMENTAL fork of minimap2 optimized for assembly-to-reference alignment☆87Updated 4 years ago
- Find all significant local alignments between reads☆141Updated last year
- Gfapy: a flexible and extensible software library for handling sequence graphs in Python☆71Updated last month
- A fast K-mer counter for high-fidelity shotgun datasets☆135Updated 3 months ago
- 🌈Scaffold genome sequence assemblies using linked or long read sequencing data☆95Updated last year
- BWT construction and search☆122Updated this week
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Updated last year
- MinHash Alignment Process (MHAP, pronounced MAP): locality-sensitive hashing to detect long-read overlaps and utilities☆98Updated 3 years ago
- GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/n…☆69Updated 3 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆85Updated this week
- Bidirectional WFA (Paper)☆48Updated last year
- ⛓ Long Interval Nucleotide K-mer Scaffolder☆74Updated 8 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
- A C++ header-only library for reading Oxford Nanopore Fast5 files☆53Updated 3 years ago
- Implementation of Positional Burrows-Wheeler Transform for genetic data☆112Updated 3 weeks ago