Abstract
In this paper we consider the incremental/decremental version of the edit distance problem: given a solution to the edit distance between two strings A and B, find a solution to the edit distance between A and B’ where B’ = aB (incremental) or bB’ = B (decremental). As a solution for the edit distance between A and B, we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit distance problem.
Cite
CITATION STYLE
Kim, S. R., & Park, K. (2000). A dynamic edit distance table. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1848, pp. 60–68). Springer Verlag. https://doi.org/10.1007/3-540-45123-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
