SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
-
Updated
Jan 12, 2024 - C++
#
smith-waterman
Here are 13 public repositories matching this topic...
Examples for SDAccel 2017.1+ on AWS F1 instances
-
Updated
Jul 24, 2017 - C++
A C++ implementation of the Smith - Waterman algorithm. The system consists of 3 different implementations: the one is sequential, while the other two parallelize the execution in a coarse and a fine level respectively, with the use of multithreading.
cplusplus
cpp
parallel
multithreading
smith-waterman
omp
sequence-alignment
fine-grained
omp-parallel
coarse-graining
parallel-programming
alignment-algorithms
smith-waterman-algorithm
-
Updated
Jan 16, 2023 - C++
A simple parallel implementation of Smith Waterman sequence alignment algorithm.
-
Updated
Oct 24, 2017 - C++
acceleration
algorithms
cache
smith-waterman
matrix-multiplication
bitonic-sort
sdaccel
high-level-synthesis
lukas-kanade
-
Updated
Oct 18, 2018 - C++
Bilkent University CS 481 Bioinformatics Algorithms assignments
smith-waterman
needleman-wunsch
rabin-karp
burrows-wheeler-transform
knuth-morris-pratt
exact-string-matching
-
Updated
Dec 5, 2019 - C++
Highly optimized Burrow-Wheeler Aligner specifically for Illumina ~150 bp short-read alignment.
-
Updated
Mar 24, 2021 - C++
Showcase of parallelization technologies using sequence alignment algorithms
benchmark
cmake
opencl
openmp
parallel-computing
parallelization
showcase
alignments
smith-waterman
needleman-wunsch
avx
openmp-support
sse
amd-opencl
-
Updated
Jan 31, 2017 - C++
Performance optimizations for Linear Gap Smith Waterman algorithm
-
Updated
May 10, 2021 - C++
PARMIK is a fast and memory-efficient tool for identifying the "Partial Match" region between two genomic sequences.
smith-waterman
k-mer
k-mer-frequency
k-mer-hashing
genome-analysis
bwa-mem
metagenomic-analysis
blastn
sratoolkit
genome-alignment
dna-processing
environment-sampling
-
Updated
Oct 18, 2024 - C++
MSc Biology C++ Course Assignment. A program that can either perform a global, or local sequence alignment. Implementation of the Smith-Waterman and Needleman-Wunsch algorithms.
smith-waterman
needleman-wunsch
global-alignment
sequence-alignment
needleman-wunsch-algorithm
local-alignment
smith-waterman-alignment
smith-waterman-algorithm
needleman-wunsch-alignment
-
Updated
Jan 31, 2023 - C++
Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment algorithm
-
Updated
Nov 16, 2018 - C++
Parallel Programming(MPI) implementation of the smith waterman algorithm
-
Updated
Jul 18, 2019 - C++
Improve this page
Add a description, image, and links to the smith-waterman topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the smith-waterman topic, visit your repo's landing page and select "manage topics."