Skip to content
#

smith-waterman

Here are 95 public repositories matching this topic...

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.

  • Updated Apr 18, 2020

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.

  • Updated Jun 22, 2024
  • Python

Improve this page

Add a description, image, and links to the smith-waterman topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the smith-waterman topic, visit your repo's landing page and select "manage topics."

Learn more