Reducing approximate Longest Common Subsequence to approximate Edit Distance

DOI10.1137/1.9781611975994.98MaRDI QIDQ5146876zbMATH OpenOpenAlexFDO

Authors Aviad Rubinstein, Zhao Song

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.05451

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• Longest common subsequence in sublinear space
• A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence
• scientific article; zbMATH DE number 7758340 (Why is no real title available?)
• Approximation algorithms for LCS and LIS with truly improved running times
• Improved approximation for longest common subsequence over small alphabets
• A linear-time \(n^{0.4}\)-approximation for longest common subsequence
• Edit distance in near-linear time: it's a constant factor

This page was built for publication: Reducing approximate Longest Common Subsequence to approximate Edit Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146876)