safaad / aim
AIM, A Framework for High-throughput Sequence Alignment using Real Processing-in-Memory Systems, Bioinformatics, btad155, https://doi.org/10.1093/bioinformatics/btad155
☆21Updated last year
Alternatives and similar repositories for aim:
Users that are interested in aim are comparing it to the libraries listed below
- A benchmark suite to study the performance characteristics of genomics applications☆29Updated 2 months ago
- Shouji is fast and accurate pre-alignment filter for banded sequence alignment calculation. Described in the Bioinformatics journal paper…☆17Updated 5 years ago
- Source code of the processing-in-memory simulator used in the GRIM-Filter paper published at BMC Genomics in 2018: "GRIM-Filter: Fast See…☆11Updated 6 years ago
- LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.☆28Updated 2 years ago
- SneakySnake is the first and the only pre-alignment filtering algorithm that works efficiently and fast on modern CPU, FPGA, and GPU arch…☆50Updated last year
- Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly☆15Updated 7 months ago
- Source code for the software implementation of SeGraM proposed in our ISCA 2022 paper: Senol Cali et. al., "SeGraM: A Universal Hardware …☆12Updated 2 years ago
- Co-processor for whole genome alignment☆12Updated 4 years ago
- Scrooge is a high-performance pairwise sequence aligner based on the GenASM algorithm. Scrooge includes three novel algorithmic improveme…☆37Updated last year
- Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository☆33Updated 2 months ago
- Source code for the software implementations of the GenASM algorithms proposed in our MICRO 2020 paper: Senol Cali et. al., "GenASM: A Hi…☆30Updated 2 years ago
- generating hardware accelerators for pangenomic graph queries☆37Updated 2 weeks ago
- A versatile pairwise aligner for genomic and spliced nucleotide sequences☆18Updated last week
- GateKeeper: Fast Alignment Filter for DNA Short Read Mapping☆18Updated 5 years ago
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆42Updated last year
- 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
- ☆12Updated 2 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 7 months ago
- RawHash can accurately and efficiently map raw nanopore signals to reference genomes of varying sizes (e.g., from viral to a human genome…☆51Updated last month
- Falcon Accelerated Genomics Pipelines☆15Updated 5 years ago
- A PIM instrumentation, compilation, execution, simulation, and evaluation repository for BLIMP-style architectures.☆16Updated 2 years ago
- Darwin: A co-processor for long read alignment☆16Updated 5 years ago
- GPU implementation of the Wavefront Alignment Algorithm for global, gap-affine, pairwise sequence alginment☆30Updated 3 months ago
- Genome-on-Diet is a fast and memory-frugal framework for exemplifying sparsified genomics for read mapping, containment search, and metag…☆11Updated 4 months ago
- CUDASW++4.0: Ultra-fast GPU-based Smith-Waterman Protein Sequence Database Search☆36Updated 2 months ago
- PyGim is the first runtime framework to efficiently execute Graph Neural Networks (GNNs) on real Processing-in-Memory systems. It provide…☆18Updated last month
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆48Updated 2 years ago
- High Performance Sorting Based Distributed memory K-mer counter☆11Updated 6 months ago
- Optimization of a Haplotype PairHMM class for GPU processing☆24Updated 7 years ago
- De Bruijn graph construction for large k.☆18Updated 3 years ago