PARMIK is a fast and memory-efficient tool for identifying the "Partial Match" region between two genomic sequences.

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.

Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment algorithm

Parallel Programming(MPI) implementation of the smith waterman algorithm

Performance optimizations for Linear Gap Smith Waterman algorithm

Bilkent University CS 481 Bioinformatics Algorithms assignments

Highly optimized Burrow-Wheeler Aligner specifically for Illumina ~150 bp short-read alignment.

Showcase of parallelization technologies using sequence alignment algorithms

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.

A simple parallel implementation of Smith Waterman sequence alignment algorithm.

Examples for SDAccel 2017.1+ on AWS F1 instances

SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)