Abstract
String-edit operations consist of insertion of a symbol, deletion of a symbol, and substituting one symbol with another. String-edit distances have been applied in problems of error correction and pattern recognition. In this paper, two practical algorithms for computing the edit distance between two strings are presented. The space complexity for the first is m + n + O(1), where m and n are the lengths of the input strings. The second requires only min(m,n)+ O(1).
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
Fu, K.S.: Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs (1982)
Sankoff, D., Kruskal, J.B.: Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, Massachusetts (1983)
Chan, T.Y.T.: Unifying Metric Approach to The Triple Parity. Artificial Intelligence 141, 123–135 (2002)
Chan, T.Y.T.: Inductive Pattern Llearning. IEEE Transactions on Systems, Man, and Cybernetics—Part A: Systems and Humans 29, 667–674 (1999)
Myers, E.W.: An O(ND) Difference Algorithm and Its Variations. Algorithmica 1, 251–266 (1986)
Myers, E.W., Miller, W.: Optimal Alignments in Linear Space. Computation Application Bioscience 4, 11–17 (1988)
Wong, C.K., Chandra, A.K.: Bounds for The String Editing Pproblem. Journal of the ACM 23, 13–16 (1976)
Wagner, R.A., Fischer, M.J.: The String to String Correction Problem. Journal of the ACM 21, 168–173 (1974)
Chan, T.Y.T.: Unsupervised Classification of Noisy Chromosomes. Bioinformatics 17, 438–444 (2001)
Chan, T.Y.T.: Running Parallel Algorithms with APL on A Sequential Machine. APL Quote Quad. 29, 25–26 (1999)
Hirschberg, D.S.: A Llinear Space Algorithm for Computing Maximal Common Subsequences. Communications of the ACM 18, 341–343 (1975)
Pekso, G.A.: Biology’s Structurally Sound Foundations. Nature 401, 115–116 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, T.Y.T. (2006). Practical Linear Space Algorithms for Computing String-Edit Distances. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_54
Download citation
DOI: https://doi.org/10.1007/11816102_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)