Skip to main content
SpringerLink
Log in

A Dynamic Edit Distance Table

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1848))

Included in the following conference series:

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.

This work was supported by the Brain Korea 21 Project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Galil, Z. and Giancarlo, R.: Data Structures and Algorithms for Approximate String Matching. J. Complexity 4 (1988) 33–72

    Article  MATH  MathSciNet  Google Scholar 

  2. Galil, Z. and Park, K.: An Improved Algorithm for Approximate String Matching. SIAM J. Computing, Vol. 19, No. 6 (1990) 989–999

    Article  MATH  MathSciNet  Google Scholar 

  3. Landau, G. M., Myers, E. W., and Schmidt, J. P.: Incremental String Comparison. SIAM J. Computing, Vol. 27, No. 2 (1998) 557–582

    Article  MATH  MathSciNet  Google Scholar 

  4. Landau, G. M. and Vishkin, U.: Fast String Matching with k Differences. J. Comput. System Sci., 37 (1998) 63–78

    Article  MathSciNet  Google Scholar 

  5. Landau, G. M. and Vishkin, U.: Fast Parallel and Serial Approximate String Matching. J. Algorithms, 10 (1989) 157–169

    Article  MATH  MathSciNet  Google Scholar 

  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–133

    Google Scholar 

  7. Ukkonen, E.: Algorithms for Approximate String Matching. Inform. and Control, 64 (1985) 100–118

    Article  MATH  MathSciNet  Google Scholar 

  8. Ukkonen, E.: Finding Approximate Patterns in Strings. J. of Algorithms, 6 (1985) 132–137

    Article  MATH  MathSciNet  Google Scholar 

  9. Ukkonen, E. and Wood, D.: Approximate String Matching with Suffix Automata. Algorithmica, 10 (1993) 353–364

    Article  MathSciNet  Google Scholar 

  10. Wagner, R. A. and Fisher, M. J.: The String-to-string Correction Problem. J. Assoc. Comput. Mach., 21 (1974) 168–173

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, Seoul, 151-742, Korea

    Sung -Ryul Kim & Kunsoo Park

Authors
  1. Sung -Ryul Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kunsoo Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

  2. Centre de recherches mathématiques, Université de Montréal, CP 6128, succursale Centre-Ville, Montréal, Québec, Canada, H3C 3J7

    David Sankoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, S.R., Park, K. (2000). A Dynamic Edit Distance Table. In: Giancarlo, R., Sankoff, D. (eds) Combinatorial Pattern Matching. CPM 2000. Lecture Notes in Computer Science, vol 1848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45123-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45123-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67633-1

  • Online ISBN: 978-3-540-45123-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation