An Object Oriented solution to the ShortestSuperstringProblem utilising the strategy design pattern.
-
Updated
Oct 31, 2018 - Java
#
shortest-common-supersequence
Here are 3 public repositories matching this topic...
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
Jan 14, 2025 - Python
Shortest common superstring generator using a greedy approximation algorithm.
-
Updated
Jul 11, 2021 - PHP
Improve this page
Add a description, image, and links to the shortest-common-supersequence topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the shortest-common-supersequence topic, visit your repo's landing page and select "manage topics."