Improved Algorithms for Edit Distance and LCS - Beyond Worst Case

Mahdi Boroujeni
Mahdi Boroujeni

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 1601-1620, 2020.

Cited by: 2|Bibtex|Views7|DOI:https://doi.org/10.5555/3381089.3381188
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org

Abstract:

Edit distance and longest common subsequence are among the most fundamental problems in combinatorial optimization. Recent developments have proven strong lower bounds against subquadratic time solutions for both problems. Moreover, the best approximation factors for subquadratic time solutions have been limited to 3 for edit distance and...More

Code:

Data:

Your rating :
0

 

Tags
Comments