Duel and sweep algorithm for order-preserving pattern matching

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

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

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationSOFSEM 2018
Subtitle of host publicationTheory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
EditorsJirí Wiedermann, A Min Tjoa, Stefan Biffl, Ladjel Bellatreche, Jan van Leeuwen
PublisherSpringer Verlag
Pages624-635
Number of pages12
ISBN (Print)9783319731162
DOIs
Publication statusPublished - 2018
Event44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018 - Krems, Austria
Duration: 2018 Jan 292018 Feb 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10706 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)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

Keywords

  • Duel-and-sweep
  • Order-preserving pattern matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Duel and sweep algorithm for order-preserving pattern matching'. Together they form a unique fingerprint.

Cite this