Skip to main content
SpringerLink
Log in

Approximate Online Matching of Circular Strings

  • Conference paper
Experimental Algorithms (SEA 2014)

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

Included in the following conference series:

Abstract

Recently a fast algorithm based on the BNDM algorithm has been presented for exact matching of circular strings. From this algorithm, we derive several sublinear methods for approximate online matching of circular strings. The applicability of the new algorithms is demonstrated with practical experiments. In many cases, the new algorithms are faster than an earlier solution.

Work supported by the Academy of Finland (grant 134287).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Communications of the ACM 35(10), 74–82 (1992)

    Article  Google Scholar 

  2. Bliven, S., Prlic, A.: Circular permutation in proteins. PLoS Computational Biology 8(3) (2012)

    Google Scholar 

  3. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM 20(10), 762–772 (1977)

    Article  MATH  Google Scholar 

  4. Bunke, H., Bühler, U.: Applications of approximate string matching to 2D shape recognition. Pattern Recognition 26(12), 1797–1812 (1993)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, K.H., Huang, G.S., Lee, R.C.T.: Exact circular pattern matching using the bit-parallelism and q-gram technique. In: Proc. of the 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 18–27. National Taipei College of Business (2012)

    Google Scholar 

  7. Ďurian, B., Holub, J., Peltola, H., Tarhio, J.: Improving practical exact string matching. Information Processing Letters 110(4), 148–152 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Faro, S., Lecroq, T.: Smart: a string matching algorithm research tool. University of Catania and Univeristy of Rouen (2011), http://www.dmi.unict.it/~faro/smart/

  9. Fredriksson, K., Navarro, N.: Average-optimal single and multiple approximate string matching. ACM Journal of Experimental Algorithmics 9, article 1.4 (2004)

    Google Scholar 

  10. Fulwider, S., Mukherjee, A.: Multiple Pattern Matching. In: The Second International Conferences on Pervasive Patterns and Applications, PATTERNS 2010, pp. 78–83 (2010)

    Google Scholar 

  11. Gregor, J., Thomason, M.G.: Dynamic programming alignment of sequences representing cyclic patterns. IEEE Trans. Pattern Anal. Mach. Intell. 15, 129–135 (1993)

    Article  Google Scholar 

  12. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)

    Google Scholar 

  13. Huh, Y., Yu, K., Heo, J.: Detecting conjugate-point pairs for map alignment between two polygon datasets. Computers, Environment and Urban Systems 35(3), 250–262 (2011)

    Article  Google Scholar 

  14. Hyyrö, H., Navarro, G.: Bit-parallel witnesses and their applications to approximate string matching. Algorithmica 41(3), 203–231 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kärkkäinen, J., Kempa, D., Puglisi, S.J.: Lightweight Lempel-Ziv parsing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 139–150. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Lin, J., Adjeroh, D.: All-against-all circular pattern matching. Computer Journal 55(7), 897–906 (2012)

    Article  Google Scholar 

  17. Lo, W.C., Lee, C.C., Lee, C.Y., Lyu, P.C.: CPDB: A database of circular permutation in proteins. Nucleic Acids Research 37(suppl. 1), D328–D332 (2009)

    Google Scholar 

  18. Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: Int’l Conference on Pattern Recognition, pp. 891–894. IEEE Computer Society Press (2000)

    Google Scholar 

  19. Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM 46(3), 395–415 (1999)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  21. Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31–88 (2001)

    Article  Google Scholar 

  22. Navarro, G.: NR-grep: A fast and flexible pattern-matching tool. Softw. Pract. Exp. 31(13), 1265–1312 (2001)

    Article  MATH  Google Scholar 

  23. Oncina, J.: The Cocke-Younger-Kasami algorithm for cyclic strings. In: ICPR 1996: Proc. 13th Int. Conf. Pattern Recognition, Vienna, Austria, pp. 413–416. IEEE Computer Society (1996)

    Google Scholar 

  24. Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 80–93. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Information and Computation 213, 13–22 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  26. Susik, R., Grabowski, S., Deorowicz, S.: Fast and simple circular pattern matching. In: Gruca, A., Czachórski, T., Kozielski, S. (eds.) Man-Machine Interactions 3. AISC, vol. 242, pp. 541–548. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tommi Hirvola & Jorma Tarhio

Authors
  1. Tommi Hirvola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorma Tarhio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of IT, University of Sydney, Building J12, 2006, Sydney, NSW, Australia

    Joachim Gudmundsson

  2. Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen East, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Hirvola, T., Tarhio, J. (2014). Approximate Online Matching of Circular Strings. In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07959-2_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07958-5

  • Online ISBN: 978-3-319-07959-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation