Python implementation of several sequence alignment algorithms such as Waterman-Smith-Beyer, Gotoh, and Needleman-Wunsch intended to calculate distance, show alignment, and display the underlying matrices.
smith-waterman needleman-wunsch jaro-winkler levenshtein-distance alignment longest-common-subsequence sequence-alignment hamming-distance jaro longest-common-substring shortest-common-supersequence gotoh hirschberg gotoh-algorithm waterman-smith-beyer
-
Updated
Jul 2, 2025 - Python