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:
- A repository for generating strobemers and evalaution☆78Updated last year
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆47Updated last year
- Optimized Dynamic Genome/Graph Implementation: understanding pangenome graphs☆211Updated 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
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆48Updated 3 years ago
- Global alignment and alignment extension☆132Updated last year
- 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
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 3 months ago
- Estimating k-mer coverage histogram of genomics data☆77Updated last year
- Self-contained, multi-threaded fasta/q parser☆43Updated 8 months ago
- Substring index for paths in a graph☆60Updated last month
- Efficient, parallel compression for terabyte-scale data☆46Updated 3 weeks ago
- utilities for indexing and sequence extraction from FASTA files☆59Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆43Updated 2 years ago
- deSALT - De Bruijn graph-based Spliced Aligner for Long Transcriptome reads☆44Updated 2 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Histosketching Using Little Kmers☆57Updated 2 years ago
- Parallel Sequence to Graph Alignment☆37Updated 2 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆54Updated 3 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆50Updated this week
- linearize and simplify variation graphs using blocked partial order alignment☆57Updated last month
- compacted de Bruijn graph construction in low memory☆100Updated 8 months ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Benchmarking pairwise aligners☆36Updated 3 months ago
- An efficient index for the colored, compacted, de Bruijn graph☆110Updated 7 months ago
- Very fast ONT basecaller☆53Updated 2 years ago
- Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository☆34Updated 6 months ago