Efficient algorithms for approximate string matching with swaps

8Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Most research on the edit distance problem and thek-differences problem considered the set of edit operations consisting of changes, insertions, and deletions. In this paper we include theswapoperation that interchanges two adjacent characters into the set of allowable edit operations, and we present anO(tmin(m,n))-time algorithm for the extended edit distance problem, wheretis the edit distance between the given strings, and anO(kn)-time algorithm for the extendedk-differences problem. That is, we add swaps into the set of edit operations without increasing the time complexities of previous algorithms that consider only changes, insertions, and deletions for the edit distance andk-differences problems. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Kim, D. K., Lee, J. S., Park, K., & Cho, Y. (1999). Efficient algorithms for approximate string matching with swaps. Journal of Complexity, 15(1), 128–147. https://doi.org/10.1006/jcom.1998.0497

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free