Edit Distance, constant-size alphabet (Sequence Alignment)
Given two strings, determine the minimum number of edits required to transform one of the strings into the other. Assume we have a constant-size alphabet.
Subproblem: Edit Sequence, constant-size alphabet
$m,n$: lengths of input strings; assume $m\leq n$
Table of Algorithms
Currently no algorithms in our database for the given problem.