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

Simple item page
dc.creatorHermelin, Danny
dc.creatorLandau, Gad M.
dc.creatorLandau, Shir
dc.creatorWeimann, Oren
dc.date2009-02-16
dc.date.accessioned2026-07-07T12:42:14Z
dc.date.available2026-07-07T12:42:14Z
dc.descriptionWe 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 $Ω(\lg N)$ speed-up in the case of arbitrary scoring functions, for any pair of strings.
dc.identifierhttps://arxiv.org/abs/0902.2649
dc.identifierhttp://arxiv.org/abs/0902.2649
dc.identifier26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 529-540
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/220004
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.titleA Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
dc.typetext

Files

Collections

arXiv