A easy and clear javascript solution of the smith-waterman algorithm.
Repository for the paper "Dotplots und Sequenzanalysen als Untersuchungsinstrumente für Überlieferungsgemeinschaften am Beispiel von Priameln"
AlnSeq runs a c coded Smith Waterman, Needleman Wunsch, and an Hirschberg.
Implementation of K-means that categorizes sequences into groups based on similarity score derived from Smith-Waterman algorithm.
GPU-accelerated implementation of the Smith-Waterman algorithm (GPU101 PiA project)
Fuzzy finder using Smith-Waterman algorithm
Pairwise alignment algorithm testing page
A benchmark for dynamic-programming-based GPU sequence alignment algorithms.
A robust tool utilizing dynamic programming algorithms for performing multiple sequence alignments (MSA) of DNA or protein sequences. This tool generalizes the Needleman-Wunsch and Smith-Waterman algorithms to support both global and local alignments for multiple sequences, providing a powerful solution for bioinformatics analyses.
Python Implementation of the Smith-Waterman Algorithm for Bioinformatics
This project is a Java implementation of the Smith-Waterman algorithm, commonly used in bioinformatics for local sequence alignment. It enables the comparison of DNA, RNA, or protein sequences by identifying regions of similarity, which can be helpful for evolutionary studies, structural analysis, and functional predictions.
PARMIK is a fast and memory-efficient tool for identifying the "Partial Match" region between two genomic sequences.
Zadanie na uczelnie. Treść: Napisz program wyszukujące wszystkie dopasowane pod sekwencje składające się z ponad k aminokwasów. Autorzy: Desert_Fox_Fenek&Ciemny99
Lectures and exercises for Genome Informatics course held on Faculty of Electrical Engineering, University of Belgrade
This program determines the optimal alignment of two nucleotide sequences using the Smith–Waterman algorithm. Optimality, of course, is determined by the values of the gap penalty g and the weight matrix (that lists all of the s(ai , bj )). Finally the program outputs the optimal similarity score along with the optimal alignment.
A miRNA Binding Site Prediction Tool
Expanded version of the traditional Smith Waterman algorithm for local alignment
Fuzzy-finder written in Rust
Add a description, image, and links to the smith-waterman topic page so that developers can more easily learn about it.
To associate your repository with the smith-waterman topic, visit your repo's landing page and select "manage topics."