Skip to content

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

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

2 Commits

Folders and files

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

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors