Skip to main content
SpringerLink
Log in

k-Abelian Pattern Matching

  • Conference paper
Book cover Developments in Language Theory (DLT 2014)

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

Included in the following conference series:

Abstract

Two words are called k-abelian equivalent, if they share the same multiplicities for all factors of length at most k. We present an optimal linear time algorithm for identifying all occurrences of factors in a text that are k-abelian equivalent to some pattern P. Moreover, an optimal algorithm for finding the largest k for which two words are k-abelian equivalent is given. Solutions for various online versions of the k-abelian pattern matching problem are also proposed.

T. Ehlers is supported by the BMBF grant 01IS110355. F. Manea is supported by the DFG grant 596676. R. Mercaş is supported by the DFG grant 582014. D. Nowotka is supported by the DFG Heisenberg grant 590179.

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. Huova, M., Karhumäki, J., Saarela, A., Saari, K.: Local squares, periodicity and finite automata. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Rainbow of Computer Science. LNCS, vol. 6570, pp. 90–101. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Huova, M., Karhumäki, J., Saarela, A.: Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci. 454, 172–177 (2012)

    Article  MATH  Google Scholar 

  3. Mercaş, R., Saarela, A.: 3-abelian cubes are avoidable on binary alphabets. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 374–383. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Rao, M.: On some generalizations of abelian power avoidability (2013) (preprint)

    Google Scholar 

  5. Karhumäki, J., Puzynina, S., Saarela, A.: Fine and Wilf’s theorem for k-abelian periods. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 296–307. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Karhumäki, J., Saarela, A., Zamboni, L.Q.: On a generalization of abelian equivalence and complexity of infinite words. J. Combin. Theory Ser. A 120(8), 2189–2206 (2013)

    Article  MathSciNet  Google Scholar 

  7. Gusfield, D.: Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  8. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM 53, 918–936 (2006)

    Article  MathSciNet  Google Scholar 

  9. Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. J. Combin. Math. Combin. Comput. 24, 33–48 (1997)

    MATH  MathSciNet  Google Scholar 

  10. Ružić, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 84–95. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time. In: SFCS 16, pp. 75–84. IEEE Computer Society (1975)

    Google Scholar 

  12. Breslauer, D., Grossi, R., Mignosi, F.: Simple real-time constant-space string matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 173–183. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Maaß, M.G.: Computing suffix links for suffix trees and arrays. Inf. Process. Lett. 101(6), 250–254 (2007)

    Article  MATH  Google Scholar 

  14. Gawrychowski, P., Lewenstein, M., Nicholson, P.K.: Weighted level ancestors in suffix trees (peprint, 2014)

    Google Scholar 

  15. Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  16. Kociumaka, T., Radoszewski, J., Rytter, W.: Efficient indexes for jumbled pattern matching with constant-sized alphabet. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 625–636. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Gagie, T., Hermelin, D., Landau, G.M., Weimann, O.: Binary jumbled pattern matching on trees and tree-like structures. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 517–528. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kiel University, D-24098, Kiel, Germany

    Thorsten Ehlers, Florin Manea, Robert Mercaş & Dirk Nowotka

Authors
  1. Thorsten Ehlers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Mercaş
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dirk Nowotka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Ural Federal University, pr. Lenina, 51, 620000, Ekaterinburg, Russia

    Arseny M. Shur  & Mikhail V. Volkov  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ehlers, T., Manea, F., Mercaş, R., Nowotka, D. (2014). k-Abelian Pattern Matching. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09698-8_16

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09697-1

  • Online ISBN: 978-3-319-09698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation