research
∙
03/09/2023
Elastic Founder Graphs Improved and Enhanced
Indexing labeled graphs for pattern matching is a central challenge of p...
share
research
∙
12/24/2021
Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model
Many problems that can be solved in quadratic time have bit-parallel spe...
research
∙
02/25/2021
Algorithms and Complexity on Indexing Founder Graphs
We study the problem of matching a string in a labeled graph. Previous r...
research
∙
05/19/2020
Linear Time Construction of Indexable Founder Block Graphs
We introduce a compact pangenome representation based on an optimal segm...
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
∙
02/03/2020
Conditional Indexing Lower Bounds Through Self-Reducibility
We provide a general technique to turn a conditional lower bound result ...
research
∙
02/10/2019
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching
Exact pattern matching in labeled graphs is the problem of searching pat...
research
∙
01/16/2019