The Smith-Waterman algorithm finds the optimal alignment of two sequences using dynamic programming techniques; Smith-Waterman is commonly used for DNA sequence alignment
-
Updated
Nov 7, 2022 - Java
The Smith-Waterman algorithm finds the optimal alignment of two sequences using dynamic programming techniques; Smith-Waterman is commonly used for DNA sequence alignment
Add a description, image, and links to the smith-waterman-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the smith-waterman-algorithm topic, visit your repo's landing page and select "manage topics."