Order preserving pattern matching on trees and DAGs

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings
編集者Rossano Venturini, Gabriele Fici, Marinella Sciortino
出版者Springer Verlag
ページ271-277
ページ数7
ISBN(印刷物)9783319674278
DOI
出版物ステータス出版済み - 1 1 2017
イベント24th International Symposium on String Processing and Information Retrieval, SPIRE 2017 - Palermo, イタリア
継続期間: 9 26 20179 29 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10508 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他24th International Symposium on String Processing and Information Retrieval, SPIRE 2017
イタリア
Palermo
期間9/26/179/29/17

Fingerprint

Pattern matching
Pattern Matching
Matching Problem
Strings
Time Complexity
Polynomials
NP-complete problem
Polynomial
Integer
Text

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Nakamura, T., Inenaga, S., Bannai, H., & Takeda, M. (2017). Order preserving pattern matching on trees and DAGs. : R. Venturini, G. Fici, & M. Sciortino (版), 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); 巻数 10508 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-67428-5_23

Order preserving pattern matching on trees and DAGs. / Nakamura, Temma; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. 版 / Rossano Venturini; Gabriele Fici; Marinella Sciortino. Springer Verlag, 2017. p. 271-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 10508 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Nakamura, T, Inenaga, S, Bannai, H & Takeda, M 2017, Order preserving pattern matching on trees and DAGs. : R Venturini, G Fici & M Sciortino (版), String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 10508 LNCS, Springer Verlag, pp. 271-277, 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, Palermo, イタリア, 9/26/17. https://doi.org/10.1007/978-3-319-67428-5_23
Nakamura T, Inenaga S, Bannai H, Takeda M. Order preserving pattern matching on trees and DAGs. : Venturini R, Fici G, Sciortino M, 編集者, String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Springer Verlag. 2017. p. 271-277. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-67428-5_23
Nakamura, Temma ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Order preserving pattern matching on trees and DAGs. String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. 編集者 / Rossano Venturini ; Gabriele Fici ; Marinella Sciortino. Springer Verlag, 2017. pp. 271-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a0817205f28f4eb5b2692ea3845c291c,
title = "Order preserving pattern matching on trees and DAGs",
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.",
author = "Temma Nakamura and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-67428-5_23",
language = "English",
isbn = "9783319674278",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "271--277",
editor = "Rossano Venturini and Gabriele Fici and Marinella Sciortino",
booktitle = "String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Order preserving pattern matching on trees and DAGs

AU - Nakamura, Temma

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85030168258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030168258&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-67428-5_23

DO - 10.1007/978-3-319-67428-5_23

M3 - Conference contribution

SN - 9783319674278

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 271

EP - 277

BT - String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings

A2 - Venturini, Rossano

A2 - Fici, Gabriele

A2 - Sciortino, Marinella

PB - Springer Verlag

ER -