Duel and sweep algorithm for order-preserving pattern matching

Davaajav Jargalsaikhan, Diptarama, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Given a text and a pattern over an alphabet, the classic exact matching problem searches for all occurrences of the pattern in the text. Unlike exact matching, order-preserving pattern matching (OPPM) considers the relative order of elements, rather t han their real values. In this paper, we propose an efficient algorithm for the OPPM problem using the “duel-and-sweep” paradigm. For a pattern of length m and a text of length n, our algorithm runs in O(n+ mlog m) time in general, and in O(n+ m) time under an assumption that the characters in a string can be sorted in linear time with respect to the string size. We also perform experiments and show that our algorithm is faster than the KMP-based algorithm.

本文言語English
ホスト出版物のタイトルSOFSEM 2018
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
編集者Jirí Wiedermann, A Min Tjoa, Stefan Biffl, Ladjel Bellatreche, Jan van Leeuwen
出版社Springer Verlag
ページ624-635
ページ数12
ISBN(印刷版)9783319731162
DOI
出版ステータスPublished - 2018
イベント44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018 - Krems, Austria
継続期間: 2018 1 292018 2 2

出版物シリーズ

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

Other

Other44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018
CountryAustria
CityKrems,
Period18/1/2918/2/2

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Duel and sweep algorithm for order-preserving pattern matching」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル