Advertisement

A Dynamic Edit Distance Table

  • Sung -Ryul Kim
  • Kunsoo Park
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1848)

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 ⊂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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Galil, Z. and Giancarlo, R.: Data Structures and Algorithms for Approximate String Matching. J. Complexity 4 (1988) 33–72zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Galil, Z. and Park, K.: An Improved Algorithm for Approximate String Matching. SIAM J. Computing, Vol. 19, No. 6 (1990) 989–999zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Landau, G. M., Myers, E. W., and Schmidt, J. P.: Incremental String Comparison. SIAM J. Computing, Vol. 27, No. 2 (1998) 557–582zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Landau, G. M. and Vishkin, U.: Fast String Matching with k Differences. J. Comput. System Sci., 37 (1998) 63–78CrossRefMathSciNetGoogle Scholar
  5. 5.
    Landau, G. M. and Vishkin, U.: Fast Parallel and Serial Approximate String Matching. J. Algorithms, 10 (1989) 157–169zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Sim, J. S., Iliopoulos, C. S., Park, K., and Smyth, W. F.: Approximate Periods of Strings. In 10th Annual Symposium, Combinatorial Pattern Matching’ 99 (1999) 123–133Google Scholar
  7. 7.
    Ukkonen, E.: Algorithms for Approximate String Matching. Inform. and Control, 64 (1985) 100–118zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Ukkonen, E.: Finding Approximate Patterns in Strings. J. of Algorithms, 6 (1985) 132–137zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Ukkonen, E. and Wood, D.: Approximate String Matching with Suffix Automata. Algorithmica, 10 (1993) 353–364CrossRefMathSciNetGoogle Scholar
  10. 10.
    Wagner, R. A. and Fisher, M. J.: The String-to-string Correction Problem. J. Assoc. Comput. Mach., 21 (1974) 168–173Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Sung -Ryul Kim
    • 1
  • Kunsoo Park
    • 1
  1. 1.School of Computer Science and EngineeringSeoul National UniversitySeoulKorea

Personalised recommendations