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.
aligning DNA and protein sequences using dynamic programming
A header-only templated C++17-library for fast and versatile sequence alignment computations.
Implementing the Smith-Waterman algorithm in Python
A compilation of all the programs in my bioinformatics course
Implement parallel Smith Waterman algorithm on CUDA
Bio informatics course materials for NEUB students.
🧬 Distributing Local Sequence Alignment using Volunteer Computing
NodeJs implementation of Smith-Waterman- and Needleman-Wunsch-Algorithm for Arrays of Objects
AlnSeq runs a c coded Smith Waterman, Needleman Wunsch, and an Hirschberg.
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.
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
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 Go implementation of the Smith–Waterman algorithm
Bio Informatics Lecture Notes @ Faculty of computer and information Sciences ' MU ' for the '4th Year' IT Department
The repository contain directories of projects done during the bioinformatics degree program
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."