smith-waterman-algorithm
There are 22 repositories under smith-waterman-algorithm topic.
poke1024/pyalign
Fast and Versatile Alignments for Python
giorgapost/smith-waterman-algorithm
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.
poke1024/simileco
A header-only templated C++17-library for fast and versatile sequence alignment computations.
shivChitinous/seq-al
aligning DNA and protein sequences using dynamic programming
CharliesCodes/bioinformatics
A compilation of all the programs in my bioinformatics course
Howeng98/Smith_Waterman_parallel
Implement parallel Smith Waterman algorithm on CUDA
mamutalib/Bio-informatics
Bio informatics course materials for NEUB students.
Seb943/Smith_Waterman_Py
Implementing the Smith-Waterman algorithm in Python
Noorts/DLSA
🧬 Distributing Local Sequence Alignment using Volunteer Computing
anita-brzoza/university_projects
The repository contain directories of projects done during the bioinformatics degree program
AntonioFuziy/DNA_mutation_detector
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
Blinsk/AlignmentOfObjectArrays
NodeJs implementation of Smith-Waterman- and Needleman-Wunsch-Algorithm for Arrays of Objects
Brandonag1997/Local-Alignment
A Go implementation of the Smith–Waterman algorithm
didar00/Global-and-Local-Alignment-Algorithms
Implementations of Needleman-Wunsch (global alignment) and Smith-Waterman (local alignment) algorithms using Python.
grace-raper/smith-waterman
The Smith-Waterman algorithm finds the optimal alignment of two sequences using dynamic programming techniques; Smith-Waterman is commonly used for DNA sequence alignment
jeremyButtler/alnSeq
AlnSeq runs a c coded Smith Waterman, Needleman Wunsch, and an Hirschberg.
Junior-Weil/Longest-Common-Subsequence
Longest Common Subsequence algorithm. Global Alignment is the Needleman Wunsche algorithm and the local alignment is Smith Waterman algorithm
Kostisef/smith-waterman-parallel
A parallel implementation of Smith-Waterman algorithm for determining similar regions between two strings of nucleic acid sequences or protein sequences.
olledejong/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.
sonechkina/SmithWaterman
R package for global alignment between two genomic sequences
fadyehabamer/BioInformatics-SandBox
Bio Informatics Lecture Notes @ Faculty of computer and information Sciences ' MU ' for the '4th Year' IT Department