A dynamic edit distance table

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1848, Issue , 2000, Pages 60-68

  Kim, Sung Ryul ^a   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

D TABLES; EDIT DISTANCE;

PATTERN MATCHING;

EID: 84937406750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_7     Document Type: Conference Paper

References (10)

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