Skip to main content
SpringerLink
Log in
Book cover

International Symposium on String Processing and Information Retrieval

SPIRE 2015: String Processing and Information Retrieval pp 177–187Cite as

Filtration Algorithms for Approximate Order-Preserving Matching

  • Conference paper
  • First Online:

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

Abstract

The exact order-preserving matching problem is to find all the substrings of a text T which have the same length and relative order as a pattern P. Like string maching, order-preserving matching can be generalized by allowing the match to be approximate. In approximate order-preserving matching two strings match if they have the same relative order after removing up to k elements in the same positions in both strings. In this paper we present practical solutions for this problem. The methods are based on filtration, and one of them is the first sublinear solution on average. We show by practical experiments that the new solutions are fast and efficient.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Chang, W.I., Lawler, E.L.: Sublinear approximate string matching and biological applications. Algorithmica 12(4/5), 327–344 (1994)

    Article  MathSciNet  MATH  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. Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Waleń, T.: 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 

  6. Gawrychowski, P., Uznanski, P.: Order-preserving pattern matching with k mismatches. CoRR, abs/1309.6453 (2013)

    Google Scholar 

  7. 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 

  8. Giaquinta, E., Grabowski, S., Fredriksson, K.: Approximate pattern matching with k-mismatches in packed text. Inf. Process. Lett. 113(19–21), 693–697 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Han, Y.: Deterministic sorting in \({O}(n\log \log n)\) time and linear space. J. Algorithms 50(1), 96–105 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hirvola, T., Tarhio, J.: Approximate online matching of circular strings. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 315–325. Springer, Heidelberg (2014)

    Google Scholar 

  11. Horspool, R.N.: Practical fast searching in strings. Softw. Pract. Exper. 10(6), 501–506 (1980)

    Article  Google Scholar 

  12. Hume, A., Sunday, D.: Fast string searching. Softw. Pract. Exper. 21(11), 1221–1248 (1991)

    Article  Google Scholar 

  13. Jacobson, G., Vo, K.: Heaviest increasing/common subsequence problems. In: Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, CPM 1992, Tucson, Arizona, USA, April 29–May 1, pp. 52–66 (1992)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Knuth Jr., D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kubica, M., Kulczynski, T., Radoszewski, J., Rytter, W., Walen, T.: A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12), 430–433 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Navarro, G.: Nr-grep: a fast and flexible pattern-matching tool. Softw. Pract. Exper. 31(13), 1265–1312 (2001)

    Article  MATH  Google Scholar 

  18. Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics 5, 4 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Proceedings of the String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8–10, pp. 80–94 (2003)

    Google Scholar 

  20. Vigna, S.: Broadword implementation of rank/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 154–168. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalto University, P.O. Box 15400, 00076, Aalto, Finland

    Tamanna Chhabra, Emanuele Giaquinta & Jorma Tarhio

Authors
  1. Tamanna Chhabra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emanuele Giaquinta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jorma Tarhio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emanuele Giaquinta .

Editor information

Editors and Affiliations

  1. King's College London, London, United Kingdom

    Costas Iliopoulos

  2. University of Helsinki, Helsinki, Finland

    Simon Puglisi

  3. University College London, London, United Kingdom

    Emine Yilmaz

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chhabra, T., Giaquinta, E., Tarhio, J. (2015). Filtration Algorithms for Approximate Order-Preserving Matching. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds) String Processing and Information Retrieval. SPIRE 2015. Lecture Notes in Computer Science(), vol 9309. Springer, Cham. https://doi.org/10.1007/978-3-319-23826-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23826-5_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23825-8

  • Online ISBN: 978-3-319-23826-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation