Edit Distance, constant-size alphabet
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.
Parameters
- : lengths of input strings; assume
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table