Skip to content
#

smith-waterman-alignment

Here are 24 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

Improve this page

Add a description, image, and links to the smith-waterman-alignment 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-alignment topic, visit your repo's landing page and select "manage topics."

Learn more