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 shortest-common-supersequence gotoh hirschberg gotoh-algorithm
-
Updated
Dec 30, 2024 - Python