Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12011 LNCS 211-222
DOI: 10.1007/978-3-030-38919-2_18
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Jargalsaikhan, D., Hendrian, D., Yoshinaka, R., & Shinohara, A. (2020). Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12011 LNCS, pp. 211–222). Springer. https://doi.org/10.1007/978-3-030-38919-2_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free