On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching

02/10/2019
by   Massimo Equi, et al.
0

Exact pattern matching in labeled graphs is the problem of searching paths of a graph G=(V,E) that spell the same string as the given pattern P[1..m]. This basic problem can be found at the heart of more complex operations on variation graphs in computational biology, query operations in graph databases, and analysis of heterogeneous networks, where the nodes of some paths must match a sequence of labels or types. In our recent work we described a conditional lower bound stating that the exact pattern matching problem in labeled graphs cannot be solved in less than quadratic time, namely, O(|E|^1 - ϵ m) time or O(|E| m^1 - ϵ) time for any constant ϵ>0, unless the Strong Exponential Time Hypothesis (SETH) is false. The result holds even if node labels and pattern P are drawn from a binary alphabet, and G is restricted to undirected graphs of maximum degree three or directed acyclic graphs of maximum sum of indegree and outdegree three. It was left open what happens on undirected graphs of maximum degree two, i.e., when the pattern can have a zig-zag match in a (cyclic) bidirectional string. Also, the reduction created a non-determistic directed acyclic graph, and it was left open if determinism would make the problem easier. In this work, we show through the Orthogonal Vectors hypothesis (OV) that the same conditional lower bound holds even for these restricted cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
12/15/2022

Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond

The problem of String Matching to Labeled Graphs (SMLG) asks to find all...
research
01/28/2022

The Complexity of Approximate Pattern Matching on De Bruijn Graphs

Aligning a sequence to a walk in a labeled graph is a problem of fundame...
research
02/03/2020

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

We consider the following string matching problem on a node-labeled grap...
research
07/15/2023

Computing SEQ-IC-LCS of Labeled Graphs

We consider labeled directed graphs where each vertex is labeled with a ...
research
02/16/2018

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs

Many problems in areas as diverse as recommendation systems, social netw...
research
02/03/2020

Conditional Indexing Lower Bounds Through Self-Reducibility

We provide a general technique to turn a conditional lower bound result ...

Please sign up or login with your details

Forgot password? Click here to reset