Edit Distance, constant-size alphabet (Sequence Alignment)
Revision as of 10:20, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Edit Distance, constant-size alphabet (Sequence Alignment)}} == 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 == <pre>n, m: lengths of input strings; assume n≥m</pre> == Table of Algorithms == Currently no algorithms in our database...")
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.
References/Citation
https://www.sciencedirect.com/science/article/pii/0022000080900021?via%3Dihub