Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
SOFSEM 2020: Theory and Practice of Computer Science (SOFSEM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12011))

  • 987 Accesses

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 \(O(\log ^ 3 m)\) time and \(O(n \log ^ 3 m)\) work on the Priority CRCW PRAM.

This research was partially supported by JSPS KAKENHI Grant Numbers JP15H05706 and JP19K20208.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cho, S., Na, J.C., Park, K., Sim, J.S.: A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115(2), 397–402 (2015)

    Article  MathSciNet  Google Scholar 

  2. Hasan, M.M., Islam, A.S., Rahman, M.S., Rahman, M.S.: Order preserving pattern matching revisited. Pattern Recogn. Lett. 55, 15–21 (2015)

    Article  Google Scholar 

  3. JáJá, J.: An Introduction to Parallel Algorithms, vol. 17. Addison-Wesley, Reading (1992)

    Google Scholar 

  4. Jargalsaikhan, D., Diptarama, Ueki, Y., Yoshinaka, R., Shinohara, A.: Duel and sweep algorithm for order-preserving pattern matching. In: Tjoa, A., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 624–635. Edizioni della Normale, Cham (2018). https://doi.org/10.1007/978-3-319-73117-9_44

    Chapter  Google Scholar 

  5. Kim, J., et al.: Order-preserving matching. Theoret. Comput. Sci. 525, 68–79 (2014)

    Article  MathSciNet  Google Scholar 

  6. Kubica, M., Kulczyński, T., Radoszewski, J., Rytter, W., Waleń, T.: A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12), 430–433 (2013)

    Article  MathSciNet  Google Scholar 

  7. Matsuoka, Y., Aoki, T., Inenaga, S., Bannai, H., Takeda, M.: Generalized pattern matching and periodicity under substring consistent equivalence relations. Theoret. Comput. Sci. 656, 225–233 (2016)

    Article  MathSciNet  Google Scholar 

  8. Vishkin, U.: Optimal parallel pattern matching in strings. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 497–508. Springer, Heidelberg (1985). https://doi.org/10.1007/BFb0015775

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Sendai, Japan

    Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka & Ayumi Shinohara

Authors
  1. Davaajav Jargalsaikhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diptarama Hendrian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ryo Yoshinaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ayumi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Davaajav Jargalsaikhan .

Editor information

Editors and Affiliations

  1. University of Macedonia, Thessaloniki, Greece

    Alexander Chatzigeorgiou

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Cyprus University of Technology, Limassol, Cyprus

    Herodotos Herodotou

  4. Carnegie Mellon University Qatar, Doha, Qatar

    Christos Kapoutsis

  5. Open University of Cyprus, Nicosia, Cyprus

    Yannis Manolopoulos

  6. University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  7. Paris Dauphine University, Paris, France

    Florian Sikora

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jargalsaikhan, D., Hendrian, D., Yoshinaka, R., Shinohara, A. (2020). Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38919-2_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38918-5

  • Online ISBN: 978-3-030-38919-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation