Multivariate Fine-Grained Complexity of Longest Common Subsequence

03/02/2018
by   Karl Bringmann, et al.
0

We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings x and y of length n, a textbook algorithm solves LCS in time O(n^2), but although much effort has been spent, no O(n^2-ε)-time algorithm is known. Recent work indeed shows that such an algorithm would refute the Strong Exponential Time Hypothesis (SETH) [Abboud, Backurs, Vassilevska Williams + Bringmann, Künnemann FOCS'15]. Despite the quadratic-time barrier, for over 40 years an enduring scientific interest continued to produce fast algorithms for LCS and its variations. Particular attention was put into identifying and exploiting input parameters that yield strongly subquadratic time algorithms for special cases of interest, e.g., differential file comparison. This line of research was successfully pursued until 1990, at which time significant improvements came to a halt. In this paper, using the lens of fine-grained complexity, our goal is to (1) justify the lack of further improvements and (2) determine whether some special cases of LCS admit faster algorithms than currently known. To this end, we provide a systematic study of the multivariate complexity of LCS, taking into account all parameters previously discussed in the literature: the input size n:={|x|,|y|}, the length of the shorter string m:={|x|,|y|}, the length L of an LCS of x and y, the numbers of deletions δ := m-L and Δ := n-L, the alphabet size, as well as the numbers of matching pairs M and dominant pairs d. For any class of instances defined by fixing each parameter individually to a polynomial in terms of the input size, we prove a SETH-based lower bound matching one of three known algorithms. Specifically, we determine the optimal running time for LCS under SETH as (n+{d, δΔ, δ m})^1± o(1). [...]

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2018

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS

We study sketching and streaming algorithms for the Longest Common Subse...
research
11/21/2017

Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy

This paper initiates the study of I/O algorithms (minimizing cache misse...
research
08/06/2020

Fine-Grained Complexity of Regular Expression Pattern Matching and Membership

The currently fastest algorithm for regular expression pattern matching ...
research
05/07/2021

Improved Approximation for Longest Common Subsequence over Small Alphabets

This paper investigates the approximability of the Longest Common Subseq...
research
01/04/2023

Parameterised and Fine-grained Subgraph Counting, modulo 2

Given a class of graphs ℋ, the problem ⊕𝖲𝗎𝖻(ℋ) is defined as follows. Th...
research
03/05/2021

Fine-Grained Complexity and Algorithms for the Schulze Voting Method

We study computational aspects of a well-known single-winner voting rule...
research
03/02/2018

Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve

Can we analyze data without decompressing it? As our data keeps growing,...

Please sign up or login with your details

Forgot password? Click here to reset