Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching

研究成果: Conference contribution

抄録

Given a text and a pattern over an alphabet, the classic exact matching problem searches for all occurrences of pattern P in text T. Unlike the exact matching problem, order-preserving pattern matching considers the relative order of elements, rather than their exact values. In this paper, we propose the first parallel algorithm for the OPPM problem. Our algorithm is based on the “duel-and-sweep” algorithm. For a pattern of length m and a text of length n, our algorithm runs in time and work on the Priority CRCW PRAM.

本文言語English
ホスト出版物のタイトルSOFSEM 2020
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings
編集者Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora
出版社Springer
ページ211-222
ページ数12
ISBN(印刷版)9783030389185
DOI
出版ステータスPublished - 2020
イベント46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020 - Limassol, Cyprus
継続期間: 2020 1 202020 1 24

出版物シリーズ

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

Conference

Conference46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020
国/地域Cyprus
CityLimassol
Period20/1/2020/1/24

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル