Fast and Versatile Alignments for Python
-
Updated
Jun 8, 2023 - C++
Fast and Versatile Alignments for Python
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 header-only templated C++17-library for fast and versatile sequence alignment computations.
Bio informatics course materials for NEUB students.
A parallel implementation of Smith-Waterman algorithm for determining similar regions between two strings of nucleic acid sequences or protein 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.
Add a description, image, and links to the smith-waterman-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the smith-waterman-algorithm topic, visit your repo's landing page and select "manage topics."