S3: Sequence Similarity Search (Protein Sequence)
-
Updated
Apr 29, 2016 - C++
S3: Sequence Similarity Search (Protein Sequence)
The GPU-version and MPI-version of PerM
Illumina (and SOLiD) sensitive read mapping tool (cloned from svn://scm.gforge.inria.fr/svnroot/storm/, original code from @marta- , with some work done by @yoann-dufresne)
DNA read mapping (seed-extension-aligner)
Highly optimized genomic resources for GPUs
Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment algorithm
coding problems from course 6 of the Bioinformatics specialization
Lightweight single-html-file-based Genome Segments playground for Visualize genome features cluster(gene arrow map or other features), add synteny among genome fragments or add crosslink among features, add short(PE/MP)/long reads(pacbio or nanopore) mapping or snpindel in vcf(not support complex sv yet), support all CIGAR of sam alignment, dire…
A systematic survey of algorithmic foundations and methodologies across 107 alignment methods (1988-2021), for both short and long reads. We provide a rigorous experimental evaluation of 11 read aligners to demonstrate the effect of these underlying algorithms on speed and efficiency of read alignment. Described by Alser et al. at https://arxiv.…
Reference-based read-mapper which performs ungapped alignment of sample reads on reference sequence.
GenStore is the first in-storage processing system designed for genome sequence analysis that greatly reduces both data movement and computational overheads of genome sequence analysis by exploiting low-cost and accurate in-storage filters. Described in the ASPLOS 2022 paper by Mansouri Ghiasi et al. at https://people.inf.ethz.ch/omutlu/pub/GenS…
The first work to provide a comprehensive survey of a prominent set of algorithmic improvement and hardware acceleration efforts for the entire genome analysis pipeline used for the three most prominent sequencing data, short reads (Illumina), ultra-long reads (ONT), and accurate long reads (HiFi). Described in arXiv (2022) by Alser et al. https…
Source code for the software implementations of the GenASM algorithms proposed in our MICRO 2020 paper: Senol Cali et. al., "GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis" at https://people.inf.ethz.ch/omutlu/pub/GenASM-approximate-string-matching-framework-for-genome-analys…
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)
GateSeeder is the first near-memory CPU-FPGA co-design for alleviating both the compute-bound and memory-bound bottlenecks in short and long-read mapping. GateSeeder outperforms Minimap2 by up to 40.3×, 4.8×, and 2.3× when mapping real ONT, HiFi, and Illumina reads, respectively.
SequenceLab is a benchmark suite for evaluating computational methods for comparing genomic sequences, such as pre-alignment filters and pairwise sequence alignment algorithms. SequenceLab is described by Rumpf et al. at https://arxiv.org/abs/2310.16908
Space-efficient minimizer-based pangenome reference graph and haplotype mapping tool
Add a description, image, and links to the read-mapping topic page so that developers can more easily learn about it.
To associate your repository with the read-mapping topic, visit your repo's landing page and select "manage topics."