Classes of Cost Functions for String Edit Distance

Algorithmica (New York)

Volumn 18, Issue 2, 1997, Pages 271-280

  Rice, S V ^a   Bunke, H ^b   Nartker, T A ^a  

^a UNIVERSITY OF NEVADA   (United States)

^b UNIVERSITY OF BERN   (Switzerland)

Author keywords

Cost function; Edit distance; Equivalence class; Longest common subsequence; String comparison

Indexed keywords

EID: 0004734437     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02526038     Document Type: Article

References (8)

1. A. V. Aho, Algorithms for finding patterns in strings, in Handbook of Theoretical Computer Science, vol. A (J. van Leeuwen, ed.), Elsevier, Amsterdam, 1990, pp. 255-300.
2. D. Sankoff and J. Kruskal, eds., Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983.
3. J. Kanai, T. A. Nartker, S. V. Rice, and G. Nagy, Performance metrics for document understanding systems, Proceedings of the Second International Conference on Document Analysis and Recognition, 1993, pp. 424-421.
4. D. Gusfield, K. Balasubramanian, and D. Naor, Parametric optimization of sequence alignment, Algorithmica, 12 (1994), 312-326.
5. H. Bunke and J. Csirik, Parametric string edit distance and its application to pattern recognition, IEEE Trans. Systems Man Cybernet., 25(1) (1995), 202-206.
6. R. A. Wagner and M. J. Fischer, The string-to-string correction problem, J. Assoc. Comput Mach., 21(1) (1974), 168-173.
7. E. Ukkonen, Algorithms for approximate string matching, Inform. and Control, 64 (1985), 100-118.
8. E. W. Myers, An O(ND) difference algorithm and its variations. Algorithmica, 1 (1986), 251-266.