arun-sub / bwa-mem2Links
Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.
☆13Updated 3 years ago
Alternatives and similar repositories for bwa-mem2
Users that are interested in bwa-mem2 are comparing it to the libraries listed below
Sorting:
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆50Updated last year
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆49Updated 3 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Global alignment and alignment extension☆132Updated 2 years ago
- A repository for generating strobemers and evalaution☆78Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 4 months ago
- Optimized Dynamic Genome/Graph Implementation: understanding pangenome graphs☆213Updated 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
- Self-contained, multi-threaded fasta/q parser☆44Updated 8 months ago
- Shouji is fast and accurate pre-alignment filter for banded sequence alignment calculation. Described in the Bioinformatics journal paper…☆17Updated 6 years ago
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆43Updated 2 years ago
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- utilities for indexing and sequence extraction from FASTA files☆59Updated 4 years ago
- deSALT - De Bruijn graph-based Spliced Aligner for Long Transcriptome reads☆44Updated 2 years ago
- Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository☆34Updated 7 months ago
- linearize and simplify variation graphs using blocked partial order alignment☆58Updated last month
- An efficient index for the colored, compacted, de Bruijn graph☆110Updated 8 months ago
- Efficient, parallel compression for terabyte-scale data☆47Updated last month
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- Substring index for paths in a graph☆60Updated 2 months ago
- micro-read Fast Alignment Search Tool☆19Updated 5 years ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆54Updated 3 years ago
- GPU implementation of the Wavefront Alignment Algorithm for global, gap-affine, pairwise sequence alginment☆35Updated last month
- compacted de Bruijn graph construction in low memory☆100Updated 8 months ago
- Create Bloom filters for a given reference and then use it to categorize sequences☆76Updated 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…☆65Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Complements Minimap2 for a fast and efficient Read-Until pipeline☆12Updated 2 years ago
- Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a sing…☆27Updated 5 years ago