CMU-SAFARI / BLEND
BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy while reducing the memory space usage of two important applications: 1) finding overlapping reads and 2) read mapping. Described by Firtina et al. (published in NARGAB https://doi.org/10.1093/nargab/lqad004)
☆43Updated last year
Alternatives and similar repositories for BLEND:
Users that are interested in BLEND are comparing it to the libraries listed below
- Scrooge is a high-performance pairwise sequence aligner based on the GenASM algorithm. Scrooge includes three novel algorithmic improveme…☆37Updated last year
- GFA visualizer, GPU-accelerated using Vulkan☆70Updated 2 years ago
- GPU implementation of the Wavefront Alignment Algorithm for global, gap-affine, pairwise sequence alginment☆34Updated 7 months ago
- AirLift is a tool that updates mapped reads from one reference genome to another. Unlike existing tools, It accounts for regions not shar…☆27Updated 11 months ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- ☆12Updated 6 years ago
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆48Updated 2 years ago
- Benchmarking pairwise aligners☆36Updated 2 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- A versatile pairwise aligner for genomic and spliced nucleotide sequences☆19Updated 3 months ago
- Assemblies from HPP Year 1 production☆73Updated last year
- Efficient, parallel compression for terabyte-scale data☆43Updated 3 months ago
- A streaming method for mapping nanopore raw signals☆32Updated 3 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 4 years ago
- RawHash can accurately and efficiently map raw nanopore signals to reference genomes of varying sizes (e.g., from viral to a human genome…☆55Updated 4 months ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated last month
- Pan-Genomic Matching Statistics☆52Updated last year
- A Scalable GPU-Based Whole Genome Aligner, published in SC20: https://doi.ieeecomputersociety.org/10.1109/SC41405.2020.00043☆71Updated 8 months ago
- Alignment-free genotyper for SNPs and short indels, implemented in Python.☆48Updated last month
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- MarginPolish: Graph based assembly polishing☆46Updated 4 years ago
- implicit pangenome graph☆58Updated 3 weeks ago
- NanoSim-H: a simulator of Oxford Nanopore reads; a fork of NanoSim.☆17Updated 2 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 11 months ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57Updated 10 months ago
- Optimized sequence graph implementations for graph genomics☆34Updated 4 months ago
- MONI: A Pangenomic Index for Finding MEMs☆37Updated 3 weeks ago
- Scalable long read self-correction and assembly polishing with multiple sequence alignment☆55Updated last year
- URMAP ultra-fast read mapper☆38Updated 4 years ago