Order preserving pattern matching on trees and DAGs

Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The order preserving pattern matching (OPPM) problem is, given a pattern string p and a text string t, find all substrings of t which have the same relative orders as p. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern p of length m and a text tree T of size N can be solved in O(m+N) time with O(m) working space if the characters of p are drawn from an integer alphabet of polynomial size. The time complexity becomes O(m log m + N) if the pattern p is over a general ordered alphabet. We then show that the OPPM problem for a single pattern and a text DAG is NP-complete.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings
EditorsRossano Venturini, Gabriele Fici, Marinella Sciortino
PublisherSpringer Verlag
Pages271-277
Number of pages7
ISBN (Print)9783319674278
DOIs
Publication statusPublished - Jan 1 2017
Event24th International Symposium on String Processing and Information Retrieval, SPIRE 2017 - Palermo, Italy
Duration: Sep 26 2017Sep 29 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10508 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Symposium on String Processing and Information Retrieval, SPIRE 2017
CountryItaly
CityPalermo
Period9/26/179/29/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Order preserving pattern matching on trees and DAGs'. Together they form a unique fingerprint.

  • Cite this

    Nakamura, T., Inenaga, S., Bannai, H., & Takeda, M. (2017). Order preserving pattern matching on trees and DAGs. In R. Venturini, G. Fici, & M. Sciortino (Eds.), String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings (pp. 271-277). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10508 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-67428-5_23