A Conditional Lower Bound for Episode Matching

Abstract

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.