Approximating LCS in Linear Time: Beating the $\sqrt{n}$ Barrier

MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun

英文摘要：

Longest common subsequence (LCS) is one of the most fundamental problems in combinatorial optimization. Apart from theoretical importance, LCS has enormous applications in bioinformatics, revision control systems, and data comparison programs. Although a simple dynamic program computes LCS in quadratic time, it has been recently proven that the problem admits a conditional lower bound and may not be solved in truly subquadratic time. In addition to this, LCS is notoriously hard with respect to approximation algorithms. Apart from a trivial sampling technique that obtains a $n^{x}$ approximation solution in time $O(n^{2-2x})$ nothing else is known for LCS. This is in sharp contrast to its dual problem edit distance for which several linear time solutions are obtained in the past two decades.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Approximating LCS and Alignment Distance over Multiple Sequences

We study the problem of aligning multiple sequences with the goal of finding an alignment that either maximizes the number of aligned symbols (the longest common subsequence (LCS)), or minimizes the number of unaligned symbols (the alignment distance (AD)). Multiple sequence alignment is a well-studied problem in bioinformatics and is used to identify regions of similarity among DNA, RNA, or protein sequences to detect functional, structural, or evolutionary relationships among them. It is known that exact computation of LCS or AD of $m$ sequences each of length $n$ requires $Θ(n^m)$ time unle…

2021-10-24cs.DS

Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time

The Longest Common Subsequence (LCS) of two strings is a fundamental string similarity measure with a classical dynamic programming solution taking quadratic time. Despite significant efforts, little progress was made in improving the runtime. Even in the realm of approximation, not much was known for linear time algorithms beyond the trivial $\sqrt{n}$-approximation. Recent breakthrough result provided a $n^{0.497}$-factor approximation algorithm [HSSS19], which was more recently improved to a $n^{0.4}$-factor one [BCD21]. The latter paper also showed a $n^{2-2.5α}$ time algorithm which outpu…

2021-12-15cs.DS

Approximation Algorithms for LCS and LIS with Truly Improved Running Times

Longest common subsequence ($\mathsf{LCS}$) is a classic and central problem in combinatorial optimization. While $\mathsf{LCS}$ admits a quadratic time solution, recent evidence suggests that solving the problem may be impossible in truly subquadratic time. A special case of $\mathsf{LCS}$ wherein each character appears at most once in every string is equivalent to the longest increasing subsequence problem ($\mathsf{LIS}$) which can be solved in quasilinear time. In this work, we present novel algorithms for approximating $\mathsf{LCS}$ in truly subquadratic time and $\mathsf{LIS}$ in truly …

2021-11-20cs.DS

Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions

We study the problem of finding personalized reserve prices for unit-demand buyers in multi-unit eager VCG auctions with correlated buyers. The input to this problem is a dataset of submitted bids of $n$ buyers in a set of auctions. The goal is to find a vector of reserve prices, one for each buyer, that maximizes the total revenue across all auctions. Roughgarden and Wang (2016) showed that this problem is APX-hard but admits a greedy $\frac{1}{2}$-approximation algorithm. Later, Derakhshan, Golrezai, and Paes Leme (2019) gave an LP-based algorithm achieving a $0.68$-approximation for the (im…

2020-07-24cs.DScs.GT

Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems

The quantum k-Local Hamiltonian problem is a natural generalization of classical constraint satisfaction problems (k-CSP) and is complete for QMA, a quantum analog of NP. Although the complexity of k-Local Hamiltonian problems has been well studied, only a handful of approximation results are known. For Max 2-Local Hamiltonian where each term is a rank 3 projector, a natural quantum generalization of classical Max 2-SAT, the best known approximation algorithm was the trivial random assignment, yielding a 0.75-approximation. We present the first approximation algorithm beating this bound, a cla…

2020-12-22cs.DSquant-ph

Approximating binary longest common subsequence in almost-linear time

The Longest Common Subsequence (LCS) is a fundamental string similarity measure, and computing the LCS of two strings is a classic algorithms question. A textbook dynamic programming algorithm gives an exact algorithm in quadratic time, and this is essentially best possible under plausible fine-grained complexity assumptions, so a natural problem is to find faster approximation algorithms. When the inputs are two binary strings, there is a simple $\frac{1}{2}$-approximation in linear time: compute the longest common all-0s or all-1s subsequence. It has been open whether a better approximation …

2023-02-09cs.DMcs.DSmath.CO

更多相关论文收起更多论文

LCS及其它序列相似性测度的二次时间硬度

Quadratic-Time Hardness of LCS and other Sequence Similarity Measures

两个重要的序列之间的相似性度量是最长公共子序列（LCS）和动态时间弯曲距离（DTWD）。在各种应用中，对两个给定序列的这些测量的计算是中心任务。简单的动态规划算法在$O(n^2)$时间内解决了这些任务，尽管进行了大量的研究，但没有已知的具有显著更好的最坏情况上限的算法。在本文中，我们证明了一个$O(n^{2-ε})$时间算法，对于某些$ε>0$，用于计算长度为$n$的两个序列的LCS或DTWD在一个恒定大小的字母表，驳斥了流行的强指数时间假设（SETH）。此外，我们表明，计算LCS的$k$字符串的大小$O(k)$的字母表不能在$O(n^{k-ε})$的时间，任何$ε>0$，SETH下。最后，我们还解决了近似的DTWD的两个字符串在真正的次二次时间的时间复杂度。

2015-01-29cs.CCcs.DS

逼近MAX-CUT的流下界

Streaming Lower Bounds for Approximating MAX-CUT

本文研究了流计算模型中图的最大割值的估计问题。在一个极端情况下，对于该问题存在仅使用$O(\log n)$空间的平凡$2$ -近似，即，计算边缘的数量并输出该值的一半作为最大切割值的估计。在另一个极端，如果允许$\tilde{O}(n)$空间，则可以通过存储基本上保留最大割的$\tilde{O}(n)$大小的稀疏化器来获得最大割值的近最优解。一个有趣的问题是，多对数空间是否足以获得最大截值的非平凡近似（即，击败因子$2$）。最近的研究表明，估计图中最大匹配的大小的问题允许在多对数空间中的非平凡近似。我们的主要结果是，任何流算法，打破$2$近似障碍需要$\tildeΩ(\sqrt{n})$空间，即使输入图的边缘是随机顺序。我们的结果是通过展示分布图是二部或$\frac{1}{2}$ -远离二部，并建立$\tildeΩ(\sqrt{n})$空间是必要的，以区分这两种情况。因此，作为一个直接的推论，我们得到，$\tildeΩ(\sqrt{n})$空间也是必要的，以测试，如果一个图是二部或$\frac{1}{2}$ -远离是二部。我们还表明，对于任何$ε> 0$，任何流算法，获得一个$(1 + ε)$ -近似的最大切割值时，边缘到达敌对的顺序需要$n^{1 - O(ε)}$空间，这意味着$Ω(n)$空间是必要的，以获得一个任意好的近似的最大切割值。

2014-09-07cs.DS

Space Efficient Deterministic Approximation of String Measures

We study approximation algorithms for the following three string measures that are widely used in practice: edit distance (ED), longest common subsequence (LCS), and longest increasing sequence (LIS). All three problems can be solved exactly by standard algorithms that run in polynomial time with roughly $Θ(n)$ space, where $n$ is the input length, and our goal is to design deterministic approximation algorithms that run in polynomial time with significantly smaller space. Towards this, we design several algorithms that achieve $1+ε$ or $1-ε$ approximation for all three problems, where $ε>0$ c…

2020-07-24cs.DS