Skip to main content
SpringerLink
Log in

Fast Multiple Order-Preserving Matching Algorithms

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2015)

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

Included in the following conference series:

Abstract

Given a text T and a pattern P, the order-preserving matching problem is to find all substrings in T which have the same relative orders as P. Order-preserving matching has been an active research area since it was introduced by Kubica et al. [13] and Kim et al. [11]. In this paper we present two algorithms for the multiple order-preserving matching problem, one of which runs in sublinear time on average and the other in linear time on average. Both algorithms run much faster than the previous algorithms.

J.S. Sim—This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2014R1A2A1A11050337).

K. Park—This research was supported by the Bio&Medical Technology Development Program of the NRF funded by the Korean government, MSIP (NRF-2014M3C9A3063541).

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

Similar content being viewed by others

Notes

  1. 1.

    For the implementation of the van-Emde-Boas tree used in [2], we used the source code publicly available at https://code.google.com/p/libveb/.

References

  1. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions. Dover, New York (1972)

    MATH  Google Scholar 

  2. Belazzougui, D., Pierrot, A., Raffinot, M., Vialette, S.: Single and multiple consecutive permutation motif search. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 66–77. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Chhabra, T., Tarhio, J.: Order-preserving matching with filtration. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 307–314. Springer, Heidelberg (2014)

    Google Scholar 

  4. 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  MATH  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Crochemore, M., et al.: Order-preserving incomplete suffix trees and order-preserving indexes. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 84–95. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Faro, S., Külekci, O.: Efficient Algorithms for the Order Preserving Pattern Matching Problem. arXiv preprint arxiv:1501.04001 (2015)

  8. Gawrychowski, P., Uznański, P.: Order-preserving pattern matching with k mismatches. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 130–139. Springer, Heidelberg (2014)

    Google Scholar 

  9. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249–260 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kim, J., Amir, A., Na, J.C., Park, K., Sim, J.S.: On representations of ternary order relations in numeric strings. In: ICABD, pp. 46–52. Springer (2014)

    Google Scholar 

  11. Kim, J., Eades, P., Fleischer, R., Hong, S., Iliopoulos, C.S., Park, K., Puglisi, S.J., Tokuyama, T.: Order-preserving matching. Theoret. Comput. Sci. 525, 68–79 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Knuth, D.E.: The Art of Computer Programming, vol. 2. Seminumerical Algorithms. Addison Wesley, Reading (1998)

    Google Scholar 

  13. 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  MATH  Google Scholar 

  14. Wu, S., Manber, U.: A fast algorithm for multi-pattern searching. Technical report. TR-94-17, Department of Computer Science, University of Arizona (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Myoungji Han, Geonmo Gu & Kunsoo Park

  2. Department of Computer Science and Information Engineering, Inha University, Incheon, Korea

    Munseong Kang, Sukhyeun Cho & Jeong Seop Sim

Authors
  1. Myoungji Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Munseong Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sukhyeun Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Geonmo Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jeong Seop Sim
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Kunsoo Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kunsoo Park .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Verona, Verona, Italy

    Zsuzsanna Lipták

  2. Dept. of Computing and Software, McMaster University, Hamilton, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Han, M., Kang, M., Cho, S., Gu, G., Sim, J.S., Park, K. (2016). Fast Multiple Order-Preserving Matching Algorithms. In: Lipták, Z., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2015. Lecture Notes in Computer Science(), vol 9538. Springer, Cham. https://doi.org/10.1007/978-3-319-29516-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29516-9_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29515-2

  • Online ISBN: 978-3-319-29516-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation