• Home
  • Search
  • Solving String Problems on Graphs Using the Labeled Direct Product
  • Cite Icon3
  • https://doi.org/10.1007/s00453-022-00989-xCopy DOI Icon

Solving String Problems on Graphs Using the Labeled Direct Product

Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Suffix trees are an important data structure at the core of optimal solutions to many fundamental string problems, such as exact pattern matching, longest common substring, matching statistics, and longest repeated substring. Recent lines of research focused on extending some of these problems to vertex-labeled graphs, either by using efficient ad-hoc approaches which do not generalize to all input graphs, or by indexing difficult graphs and having worst-case exponential complexities. In the absence of an ubiquitous and polynomial tool like the suffix tree for labeled graphs, we introduce the labeled direct product of two graphs as a general tool for obtaining optimal algorithms in the worst case: we obtain conceptually simpler algorithms for the quadratic problems of string matching (SMLG) and longest common substring (LCSP) in labeled graphs. Our algorithms run in time linear in the size of the labeled product graph, which may be smaller than quadratic for some inputs, and their run-time is predictable, because the size of the labeled direct product graph can be precomputed efficiently. We also solve LCSP on graphs containing cycles, which was left as an open problem by Shimohira et al. in 2011. To show the power of the labeled product graph, we also apply it to solve the matching statistics (MSP) and the longest repeated string (LRSP) problems in labeled graphs. Moreover, we show that our (worst-case quadratic) algorithms are also optimal, conditioned on the Orthogonal Vectors Hypothesis. Finally, we complete the complexity picture around LRSP by studying it on undirected graphs.

Loading PDF

Similar Papers
  • Dissertation

2-Dimensional String Problems: Data Structures and Quantum Algorithms

  • Jul 01, 2022
  • Dhrumilkumar Patel
  • Research Article
  • Citations2

Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching

  • Aug 05, 2024
  • ACM Transactions on Algorithms
  • Ce Jin +1
  • Research Article
  • Citations31

A faster algorithm to recognize undirected path graphs

  • Jun 01, 1993
  • Discrete Applied Mathematics
  • Alejandro A Schäffer
  • Research Article
  • Citations5

Computing matching statistics on Wheeler DFAs.

  • Mar 01, 2023
  • Proceedings. Data Compression Conference
  • Alessio Conte +5
  • Supplementary Content
  • Citations1

Exact Matching: Algorithms and Related Problems

  • Jan 01, 2023
  • Repository for Publications and Research Data (ETH Zurich)
  • El Maalouly, Nicolas
  • Research Article
  • Citations5

Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching

  • Sep 24, 2015
  • Journal of Computational Biology
  • Anas Al-Okaily
  • Conference Article
  • Citations10

A fast and lightweight filter-based algorithm for circular pattern matching

  • Sep 20, 2014
  • Md Aashikur Rahman Azim +3
  • PDF
  • Research Article

Pattern Masking for Dictionary Matching: Theory and Practice

  • Mar 06, 2024
  • Algorithmica
  • Panagiotis Charalampopoulos +6
  • Research Article

Discovering regularities in biosequences: Challenges and applications

  • Sep 27, 2006
  • Journal of Computational Methods in Sciences and Engineering
  • C.H Makris +2
  • Research Article
  • Citations3

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

  • Mar 01, 2022
  • IEICE Transactions on Information and Systems
  • Naoki Kitamura +1
  • Conference Article
  • Citations58

String Matching in Hardware Using the FM-Index

  • May 01, 2011
  • Edward Fernandez +2
  • Research Article
  • Citations30

Estimation of Laplacian spectra of direct and strong product graphs

  • Dec 28, 2015
  • Discrete Applied Mathematics
  • Hiroki Sayama
  • PDF
  • Research Article
  • Citations1

On star coloring of modular product of graphs

  • Aug 25, 2020
  • Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics
  • Kaliraj K +2
  • Research Article
  • Citations1

Different-Distance Sets in a Graph

  • Dec 01, 2019
  • SHILAP Revista de lepidopterología
  • Jason T Hedetniemi +3
  • Supplementary Content
  • Citations1

Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space

  • Jan 01, 2021
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Dhrumil Patel +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.