Approximating LCS in Linear Time: Beating the √n Barrier

DOI10.1137/1.9781611975482.72zbMath1431.68170arXiv2003.07285OpenAlexW2903274221MaRDI QIDQ5236256

Masoud Seddighin, Saeed Seddighin, Xiaorui Sun, Mohammad Taghi Hajiaghayi

Publication date: 15 October 2019

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

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

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: Approximating LCS in Linear Time: Beating the √n Barrier