Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time

Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time. Ando...

Full description

Bibliographic Details

Published in:	2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) pp. 979 - 990
Main Authors:	Chakraborty, Diptarka, Das, Debarati, Goldenberg, Elazar, Koucky, Michal, Saks, Michael
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2018
Subjects:	Approximation algorithm Approximation algorithms Computer science Dynamic programming Edit distance Heuristic algorithms Indexes Randomized algorithm Runtime Sub quadratic time algorithm Upper bound
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!