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...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 990 - 1001
Main Authors:	Andoni, Alexandr, Nosatzki, Negev Shekel
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2020
Subjects:	Additives Approximation algorithms Complexity theory edit distance fine-grained complexity Measurement Signal processing algorithms sublinear algorithms Transforms
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!