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
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.

  • Updated Jan 16, 2023
  • C++

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