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.
aligning DNA and protein sequences using dynamic programming
Implementing the Smith-Waterman algorithm in Python
Bio informatics course materials for NEUB students.
A compilation of all the programs in my bioinformatics course
Implement parallel Smith Waterman algorithm on CUDA
🧬 Distributing Local Sequence Alignment using Volunteer Computing
A C++ project to detect mutations on DNA sequence, comparing two DNA samples. This project was built based on a Supercomputing subject and some classic algorithms are used in this project, such as Smith Waterman, Random Local Search and Exaustive Search
The repository contain directories of projects done during the bioinformatics degree program
AlnSeq runs a c coded Smith Waterman, Needleman Wunsch, and an Hirschberg.
NodeJs implementation of Smith-Waterman- and Needleman-Wunsch-Algorithm for Arrays of Objects
Next.js project implementing bioinformatics algorithms, including Needleman-Wunsch and Smith-Waterman, for sequence alignment with a modern web interface. ICSI310 ,Introduction to Bioinformatics
A parallel implementation of Smith-Waterman algorithm for determining similar regions between two strings of nucleic acid sequences or protein sequences.
Implementations of Needleman-Wunsch (global alignment) and Smith-Waterman (local alignment) algorithms using Python.
Longest Common Subsequence algorithm. Global Alignment is the Needleman Wunsche algorithm and the local alignment is Smith Waterman algorithm
The Smith-Waterman algorithm finds the optimal alignment of two sequences using dynamic programming techniques; Smith-Waterman is commonly used for DNA sequence alignment
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."