Computer Science – Computational Complexity
Scientific paper
2009-02-16
26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 529-540
Computer Science
Computational Complexity
Scientific paper
We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length $N$ having straight-line program representations of total size $n$, we provide an algorithm running in $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(n^{1.34}N^{1.34})$ time algorithm for arbitrary scoring functions. This improves on a recent algorithm of Tiskin that runs in $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 $\Omega(\lg N)$ speed-up in the case of arbitrary scoring functions, for any pair of strings.
Hermelin Danny
Landau Gad M.
Landau Shir
Weimann Oren
No associations
LandOfFree
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-462849