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. Different types of edit distance allow different sets of string operations (deletion, substitution, insertion, etc.)