Abstract
String comparison is a fundamental task in theoretical computer science, with applications in e.g., spelling correction and computational biology. Edit distance is a classic similarity measure between two given strings A and B. It is the minimum total cost for transforming A into B, or vice versa, using three types of edit operations: single-character insertions, deletions, and/or substitutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental String Comparison. SIAM J. Comp. 27(2), 557–582 (1998)
Schmidt, J.P.: All Highest Scoring Paths in Weighted Grid Graphs and Their Application in Finding All Approximate Repeats in Strings. SIAM J. Comp. 27(4), 972–992 (1998)
Kim, S.R., Park, K.: A Dynamic Edit Distance Table. J. Disc. Algo. 2, 302–312 (2004)
Hyyrö, H.: An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 155–163. Springer, Heidelberg (2008)
Masek, W.J., Paterson, M.: A Faster Algorithm Computing String Edit Distances. J. Comput. Syst. Sci. 20(1), 18–31 (1980)
Arnold, R., Bell, T.: A Corpus for the Evaluation of Lossless Compression Algorithms. In: Proc. DCC 1997, pp. 201–210 (1997), http://corpus.canterbury.ac.nz/
Kurtz, S.: Approximate String Searching under Weighted Edit Distance. In: Proc. 3rd South American Workshop on String Processing (WSP 1996), pp. 156–170 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyyrö, H., Narisawa, K., Inenaga, S. (2010). Dynamic Edit Distance Table under a General Weighted Cost Function. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)