Affiliation:
1. University of Helsinki, Helsinki, Finland
2. Università di, Pisa, Italy
Abstract
Exact string matching in labeled graphs is the problem of searching paths of a graph
G=(V, E)
such that the concatenation of their node labels is equal to a given pattern string
P
[1.
m
]. This basic problem can be found at the heart of more complex operations on variation graphs in computational biology, of query operations in graph databases, and of analysis operations in heterogeneous networks.
We prove a conditional lower bound stating that, for any constant ε > 0, an
O
(|
E
|
1 - ε
m
) time, or an
O
(|
E
|
m
1 - ε
)time algorithm for exact string matching in graphs, with node labels and pattern drawn from a binary alphabet, cannot be achieved unless the Strong Exponential Time Hypothesis (
SETH
) is false. This holds even if restricted to undirected graphs with maximum node degree 2—that is, to
zig-zag matching in bidirectional strings
, or to
deterministic
directed acyclic graphs whose nodes have maximum sum of indegree and outdegree 3. These restricted cases make the lower bound stricter than what can be directly derived from related bounds on regular expression matching (Backurs and Indyk, FOCS’16). In fact, our bounds are tight in the sense that lowering the degree or the alphabet size yields linear time solvable problems.
An interesting corollary is that exact and approximate matching are equally hard (i.e., quadratic time) in graphs under
SETH
. In comparison, the same problems restricted to strings have linear time vs quadratic time solutions, respectively (approximate pattern matching having also a matching
SETH
lower bound (Backurs and Indyk, STOC’15)).
Funder
Academy of Finland
European Research Council
European Union’s Horizon 2020 research and innovation programme
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献