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.4N^1.2)$ time for computing the edit-distance of these two strings under any rational scoring function, and an $O(n^1.34N^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 $$ speed-up in the case of arbitrary scoring functions, for any pair of strings.
|State||Published - 2009|
|Event||26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 - Freiburg, Germany|
Duration: 26 Feb 2009 → 28 Feb 2009
|Conference||26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009|
|Period||26/02/09 → 28/02/09|
- Computer Science - Computational Complexity
- Computer Science - Data Structures and Algorithms