-
Notifications
You must be signed in to change notification settings - Fork 0
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.
madisonlondon/Nucleotide-Alignment
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This code was created by Madison London and Sophie Borchart
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published