Edit Distance, constant-size alphabet (Sequence Alignment)

From Algorithm Wiki
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

$m,n$: lengths of input strings; assume $m\leq n$

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