Practical linear space algorithms for computing string-edit distances

Authors:
Tony Y. T. Chan
Affiliations:
The University of Akureyri, Solborg, Akureyri, Iceland
Venue:
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Year:
2006

Citing 6
Cited 0

The String-to-String Correction Problem

Journal of the ACM (JACM)
Bounds for the String Editing Problem

Journal of the ACM (JACM)
Running parallel algorithms with APL on a sequential machine

ACM SIGAPL APL Quote Quad
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Unifying metric approach to the triple parity

Artificial Intelligence
Inductive pattern learning

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

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).