Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be compu...
详细信息
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratictime. Andoni, Krauthgamer, and Onak (2010) gave a nearly linear timealgorithm that approximates edit distance within approximation factor poly(log n). In this article, we provide an algorithm with running time (O) over tildeO(n(2-2/7)) that approximates the edit distance within a constant factor.
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be compu...
详细信息
ISBN:
(纸本)9781538642306
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratictime. Andoni, Krauthgamer and Onak (2010) gave a nearly linear timealgorithm that approximates edit distance within approximation factor poly(log n). In this paper, we provide an algorithm with running time (O) over tilde (n(2-2/7)) that approximates the edit distance within a constant factor.
暂无评论