A Conditional Lower Bound for Episode Matching

08/19/2021
by   Philip Bille, et al.
0

Given two strings S and P, the Episode Matching problem is to compute the length of the shortest substring of S that contains P as a subsequence. The best known upper bound for this problem is Õ(nm) by Das et al. (1997), where n,m are the lengths of S and P, respectively. Although the problem is well studied and has many applications in data mining, this bound has never been improved. In this paper we show why this is the case by proving that an O((nm)^1-ϵ) algorithm (even for binary strings) would refute the popular Strong Exponential Time Hypothesis (SETH). The proof is based on a simple reduction from Orthogonal Vectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2019

Weighted Shortest Common Supersequence Problem Revisited

A weighted string, also known as a position weight matrix, is a sequence...
research
04/01/2023

L is unequal NL under the Strong Exponential Time Hypothesis

Due to Savitch's theorem we know NL⊆ DSPACE(log^2(n)). To show this uppe...
research
10/27/2014

Exact Expression For Information Distance

Information distance can be defined not only between two strings but als...
research
04/30/2018

On improving the approximation ratio of the r-shortest common superstring problem

The Shortest Common Superstring problem (SCS) consists, for a set of str...
research
01/16/2019

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree

Exact pattern matching in labeled graphs is the problem of searching pat...
research
02/01/2023

Agility and Target Distribution in the Dynamic Stochastic Traveling Salesman Problem

An important variant of the classic Traveling Salesman Problem (TSP) is ...
research
07/20/2021

Hardness of Detecting Abelian and Additive Square Factors in Strings

We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assumin...

Please sign up or login with your details

Forgot password? Click here to reset