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

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 $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.
Type de document :
Communication dans un congrès
Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.529-540, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00360821
Contributeur : Publications Loria <>
Soumis le : lundi 16 février 2009 - 10:49:34
Dernière modification le : lundi 16 février 2009 - 11:15:01
Document(s) archivé(s) le : mardi 8 juin 2010 - 20:44:35

Fichiers

Hermelin_new.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00360821, version 1
  • ARXIV : 0902.2649

Collections

Citation

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann. A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.529-540, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00360821〉

Partager

Métriques

Consultations de la notice

70

Téléchargements de fichiers

77