Edit Distance, constant-size alphabet (Sequence Alignment)
Jump to navigation
Jump to search
Description
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.
Related Problems
Subproblem: Edit Sequence, constant-size alphabet
Parameters
n, m: lengths of input strings; assume n≥m
Table of Algorithms
Currently no algorithms in our database for the given problem.