Algorithms that measure how different two sequences are or line them up, such as Levenshtein distance, Damerau-Levenshtein distance, Needleman-Wunsch, Smith-Waterman and Hirschberg's algorithm. An algorithm belongs here when its cited article describes a distance between strings or an alignment of sequences. It excludes exact pattern searching, which sits in the string searching group. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.
Browse By
Edit Distance and Sequence Alignment Algorithms
Filter Results11 entries
Sources
Velvet (software) (Wikipedia)
Levenshtein distance, Wikipedia
Has Member: Levenshtein Distance Algorithm, Lead sectionQuote, Has Member: Levenshtein Distance Algorithm, Lead section
string metric for measuring the difference between two sequences
Needleman-Wunsch algorithm (Wikipedia)
Has Member: Needleman-Wunsch Algorithm, Lead sectionQuote, Has Member: Needleman-Wunsch Algorithm, Lead section
used in bioinformatics to align protein or nucleotide sequences
Smith-Waterman algorithm (Wikipedia)
Has Member: Smith-Waterman Algorithm, Lead sectionQuote, Has Member: Smith-Waterman Algorithm, Lead section
performs local sequence alignment
Hirschberg's algorithm (Wikipedia)
Has Member: Hirschberg's Algorithm, Lead sectionQuote, Has Member: Hirschberg's Algorithm, Lead section
finds the optimal sequence alignment
Wikipedia: Sequence alignment
Has Member: Sequence Alignment, Lead sectionQuote, Has Member: Sequence Alignment, Lead section
a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity
Damerau-Levenshtein distance (Wikipedia)
Has Member: Damerau-Levenshtein Distance Algorithm, Lead sectionQuote, Has Member: Damerau-Levenshtein Distance Algorithm, Lead section
is a string metric for measuring the edit distance between two sequences
Jaro-Winkler distance (Wikipedia)
Has Member: Jaro-Winkler Distance Algorithm, Lead sectionQuote, Has Member: Jaro-Winkler Distance Algorithm, Lead section
is a string metric measuring an edit distance between two sequences
Dynamic time warping (Wikipedia)
Has Member: Dynamic Time Warping Algorithm, Lead sectionQuote, Has Member: Dynamic Time Warping Algorithm, Lead section
algorithm for measuring similarity between two temporal sequences
Wikipedia: Shortest common supersequence
Has Member: Shortest Common Supersequence, LeadQuote, Has Member: Shortest Common Supersequence, Lead
This is a problem closely related to the longest common subsequence problem.
Wikipedia: Longest Common Subsequence Algorithm
Wikimedia FoundationHas Member: Longest Common Subsequence Algorithm, LeadQuote, Has Member: Longest Common Subsequence Algorithm, Lead
A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences).
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.