Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression

Published 16 Feb 2009 in cs.CC and cs.DS | (0902.2649v1)

Abstract: We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length NN having straight-line program representations of total size nn, we provide an algorithm running in O(n1.4N1.2)O(n^{1.4}N^{1.2}) time for computing the edit-distance of these two strings under any rational scoring function, and an O(n1.34N1.34)O(n^{1.34}N^{1.34}) time algorithm for arbitrary scoring functions. This improves on a recent algorithm of Tiskin that runs in O(nN1.5)O(nN^{1.5}) time, and works only for rational scoring functions. Also, in the last part of the paper, we show how the classical four-russians technique can be incorporated into our SLP edit-distance scheme, giving us a simple Ω(lg⁡N)\Omega(\lg N) speed-up in the case of arbitrary scoring functions, for any pair of strings.

Citations (53)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.