You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The Smith-Waterman algorithm is essentially a paiwise sequence alignment algorithm typically used in bioinformatics to optimally align two (e.g. DNA) sequences.
The Smith-Waterman algorithm can be seen as a generalization of the edit distance and on the other hand the edit distance can be considered as a special case of the Smith-Waterman algorithm with specific scoring rules (giving specific weights to matching, mismatching string characters and gaps). There's more info here:
The Smith-Waterman algorithm is essentially a paiwise sequence alignment algorithm typically used in bioinformatics to optimally align two (e.g. DNA) sequences.
The Smith-Waterman algorithm can be seen as a generalization of the edit distance and on the other hand the edit distance can be considered as a special case of the Smith-Waterman algorithm with specific scoring rules (giving specific weights to matching, mismatching string characters and gaps). There's more info here:
The text was updated successfully, but these errors were encountered: