论文信息 - A Dynamic Edit Distance Table

A Dynamic Edit Distance Table

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.

Sung-Ryul Kim | Kunsoo Park

[1] Esko Ukkonen,et al. Finding Approximate Patterns in Strings , 1985, J. Algorithms.

[2] Jeong Seop Sim,et al. Approximate Periods of Strings , 1999, CPM.

[3] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[4] Zvi Galil,et al. An Improved Algorithm for Approximate String Matching , 1989, SIAM J. Comput..

[5] Esko Ukkonen,et al. Algorithms for Approximate String Matching , 1985, Inf. Control..

[6] Raffaele Giancarlo,et al. Data structures and algorithms for approximate string matching , 1988, J. Complex..

[7] Uzi Vishkin,et al. Fast String Matching with k Differences , 1988, J. Comput. Syst. Sci..

[8] Gad M. Landau,et al. Fast Parallel and Serial Approximate String Matching , 1989, J. Algorithms.

[9] Gad M. Landau,et al. Incremental String Comparison , 1998, SIAM J. Comput..