CMU-SAFARI / Scrooge
Scrooge is a high-performance pairwise sequence aligner based on the GenASM algorithm. Scrooge includes three novel algorithmic improvements on top of GenASM, and high-performance CPU and GPU implementations. Described by Lindegger et al. at https://doi.org/10.48550/arXiv.2208.09985
☆37Updated last year
Alternatives and similar repositories for Scrooge:
Users that are interested in Scrooge are comparing it to the libraries listed below
- AirLift is a tool that updates mapped reads from one reference genome to another. Unlike existing tools, It accounts for regions not shar…☆27Updated 10 months ago
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆43Updated last year
- GPU implementation of the Wavefront Alignment Algorithm for global, gap-affine, pairwise sequence alginment☆33Updated 6 months ago
- A versatile pairwise aligner for genomic and spliced nucleotide sequences☆19Updated 2 months ago
- FastRemap, a C++ tool for quickly remapping reads between genome assemblies based on the commonly used CrossMap tool. Link to paper: http…☆26Updated 2 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57Updated 10 months ago
- De Bruijn graph construction for large k.☆18Updated 3 years ago
- Benchmarking pairwise aligners☆36Updated last month
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆49Updated 2 years ago
- LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.☆29Updated 2 years ago
- Efficient, parallel compression for terabyte-scale data☆40Updated 2 months 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
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- URMAP ultra-fast read mapper☆38Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- nPoRe: n-Polymer Realigner for improved pileup-based variant calling☆18Updated 2 years ago
- Optimized sequence graph implementations for graph genomics☆34Updated 3 months ago
- GFA visualizer, GPU-accelerated using Vulkan☆70Updated 2 years ago
- ☆28Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Fast-SG: An alignment-free algorithm for ultrafast scaffolding graph construction from short or long reads.☆22Updated 6 years ago
- CAncer Standards Long-read Evaluation☆24Updated last month
- An experimental tool to estimate the similarity between all pairs of contigs☆35Updated 3 years ago
- Kmer Analysis of Pileups for Genotyping☆21Updated last month
- ☆17Updated last year
- C implementation of the Landau-Vishkin algorithm☆35Updated 2 years ago
- ☆16Updated 11 months ago
- Snakemake pipeline for benchmarking read mappers☆16Updated last year
- RawHash can accurately and efficiently map raw nanopore signals to reference genomes of varying sizes (e.g., from viral to a human genome…☆55Updated 3 months ago
- This is a library C/Python/CLI for working with TAF (.taf,.taf.gz) and MAF (.maf) alignment files☆26Updated 3 months ago