arun-sub / bwa-mem2
Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.
☆13Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for bwa-mem2
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆45Updated 8 months ago
- deSALT - De Bruijn graph-based Spliced Aligner for Long Transcriptome reads☆44Updated 2 years ago
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆48Updated 2 years ago
- micro-read Fast Alignment Search Tool☆19Updated 5 years ago
- 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
- efficient alignment of strings to partially ordered string graphs☆33Updated 2 years ago
- A repository for generating strobemers and evalaution☆77Updated 6 months ago
- Optimized Dynamic Genome/Graph Implementation: understanding pangenome graphs☆194Updated this week
- Benchmarking pairwise aligners☆36Updated 7 months ago
- compacted de Bruijn graph construction in low memory☆99Updated last month
- Global alignment and alignment extension☆127Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 9 months ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆51Updated 2 years ago
- Sensitive and Fast Alignment Search Tool for Long Read sequencing Data.☆41Updated 5 years ago
- Self-contained, multi-threaded fasta/q parser☆43Updated last month
- Substring index for paths in a graph☆60Updated this week
- linearize and simplify variation graphs using blocked partial order alignment☆56Updated 3 weeks ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 2 years ago
- Histosketching Using Little Kmers☆55Updated last year
- Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository☆33Updated 3 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 7 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 4 years ago
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆42Updated last year
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago
- Parallel Sequence to Graph Alignment☆35Updated last year
- Long read aligner☆112Updated last year
- An efficient index for the colored, compacted, de Bruijn graph☆107Updated last month
- A method for variant graph genotyping based on exact alignment of k-mers☆87Updated 5 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Optimization of a Haplotype PairHMM class for GPU processing☆24Updated 7 years ago