Reducing approximate Longest Common Subsequence to approximate Edit Distance

DOI10.1137/1.9781611975994.98OpenAlexW3002517191MaRDI QIDQ5146876

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)

Related Items (3)

Longest common subsequence in sublinear space ⋮ A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence ⋮ Unnamed Item

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