A dynamic edit distance table

Journal of Discrete Algorithms

Volumn 2, Issue 2 SPEC. ISS., 2004, Pages 303-312

  Kim, Sung Ryul ^a   Park, Kunsoo ^b  

^a Konkuk University   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

Edit distance; Incremental decremental edit distance; String matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

EDIT DISTANCE; INCREMENTAL/DECREMENTAL EDIT DISTANCES; STRING MATCHING;

PROBLEM SOLVING;

EID: 10644266194     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00082-0     Document Type: Article

References (11)

1. Z. Galil, R. Giancarlo, Data structures and algorithms for approximate string matching, J. Complexity 4 (1988) 33-72.
2. Z. Galil, K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (6) (1990) 989-999.
3. G.M. Landau, E.W. Myers, J.P. Schmidt, Incremental string comparison, SIAM J. Comput. 27 (2) (1998) 557-582.
4. G.M. Landau, U. Vishkin, Fast string matching with k differences, J. Comput. System Sci. 37 (1988) 63-78.
5. G.M. Landau, U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (1989) 157-169.
6. J.P. Schmidt, All highest scoring paths in weighted graphs and their applications to finding all approximate repeats in strings, SIAM J. Comput. 27 (4) (1998) 972-992.
7. J.S. Sim, C.S. Iliopoulos, K. Park, W.F. Smyth, Approximate periods of strings, Theoret. Comput. Sci. 262 (1-2) (2001) 557-568.
8. E. Ukkonen, Algorithms for approximate string matching, Inform, and Control 64 (1985) 100-118.
9. E. Ukkonen, Finding approximate patterns in strings, J. Algorithms 6 (1985) 132-137.
10. E. Ukkonen, D. Wood, Approximate string matching with suffix automata, Algorithmica 10 (1993) 353-364.
11. R.A. Wagner, M.J. Fisher, The string-to-string correction problem, J. Assoc. Comput. Mach. 21 (1974) 168-173.