Edit Distance in Near-Linear Time: it's a Constant Factor

We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+\epsilon} , for any \epsilon > 0 , up to a constant factor. Our result completes a research direction set forth in the recent breakthrough paper [1], which showed the first constant-factor app...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / annual Symposium on Foundations of Computer Science S. 990 - 1001
Hauptverfasser:	Andoni, Alexandr, Nosatzki, Negev Shekel
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.11.2020
Schlagworte:	Additives Approximation algorithms Complexity theory edit distance fine-grained complexity Measurement Signal processing algorithms sublinear algorithms Transforms
ISSN:	2575-8454
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!