maxdoblas / QuickEdLinks
QuickEd is a high-performance exact sequence alignment based on the bound-and-align paradigm.
☆27Updated 8 months ago
Alternatives and similar repositories for QuickEd
Users that are interested in QuickEd are comparing it to the libraries listed below
Sorting:
- Wavefront alignment algorithm (WFA) in Golang☆32Updated 5 months ago
- URMAP ultra-fast read mapper☆38Updated 5 years ago
- MONI: A Pangenomic Index for Finding MEMs☆37Updated 9 months ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- A k-mer search engine for all Sequence Read Archive public accessions☆36Updated last year
- Differential k-mer analysis☆39Updated last year
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- base-accurate DNA sequence alignments using edlib and mashmap2☆32Updated 4 years ago
- Improved structural variant discovery in accurate long reads using sample-specific strings (SFS)☆47Updated 4 months ago
- ☆28Updated 9 months ago
- De Bruijn graph construction for large k.☆17Updated 4 years ago
- GFA insert into GenomicSQLite☆49Updated 4 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆23Updated 2 months ago
- Long-read aligner to pangenome graphs☆29Updated last year
- Python wrapper for wavefront alignment using WFA2-lib☆38Updated last year
- Kmer Analysis of Pileups for Genotyping☆35Updated this week
- A multiscale pangenome browser☆28Updated last month
- syncmer graphs, and perhaps other sorts of sequence graphs☆24Updated 2 weeks ago
- A toolkit for exploring regions of variation in pangenomes☆12Updated this week
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Updated last month
- Efficient low-divergence mapping of long reads in minimizer space☆70Updated 2 years ago
- ☆45Updated 2 months ago
- Extracts subgraphs or components from a graph in GFA format☆24Updated last year
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated 7 months ago
- Software that separates very close sequences that have been collapsed during assembly. Uses only long reads.☆35Updated 8 months ago
- Profile HMM-based hybrid error correction algorithm for long reads☆21Updated 7 years ago
- ☆24Updated 4 months ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆55Updated 3 years ago
- ☆19Updated last year
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆70Updated last year