You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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 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
A parallel implementation of Smith-Waterman algorithm for determining similar regions between two strings of nucleic acid sequences or protein sequences.
The Smith-Waterman algorithm finds the optimal alignment of two sequences using dynamic programming techniques; Smith-Waterman is commonly used for DNA sequence alignment
Next.js project implementing bioinformatics algorithms, including Needleman-Wunsch and Smith-Waterman, for sequence alignment with a modern web interface. ICSI310 ,Introduction to Bioinformatics
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.