Deterministic Longest Common Subsequence Approximation in Near-Linear Time
Data Structures and Algorithms
2025-07-31 v1
Abstract
We provide a deterministic algorithm that outputs an -approximation for the Longest Common Subsequence (LCS) of two input sequences of length in near-linear time. This is the first deterministic approximation algorithm for LCS that achieves a sub-linear approximation ratio in near-linear time.
Cite
@article{arxiv.2507.22486,
title = {Deterministic Longest Common Subsequence Approximation in Near-Linear Time},
author = {Itai Boneh and Shay Golan and Matan Kraus},
journal= {arXiv preprint arXiv:2507.22486},
year = {2025}
}