Skip to main content
SpringerLink
Log in

Efficient Data Structures for the Factor Periodicity Problem

  • Conference paper
String Processing and Information Retrieval (SPIRE 2012)

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

Included in the following conference series:

Abstract

We present several efficient data structures for answering queries related to periods in words. For a given word w of length n the Period Query given a factor of w (represented by an interval) returns its shortest period and a compact representation of all periods. Several algorithmic solutions are proposed that balance the data structure space (ranging from O(n) to O(nlogn)), and the query time complexity (ranging from O(log1 + ε n) to O(logn)).

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. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)

    Google Scholar 

  2. Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.: Extracting Powers and Periods in a String from Its Runs Structure. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 258–269. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2003)

    Google Scholar 

  4. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137–143. IEEE Computer Society (1997)

    Google Scholar 

  5. Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society 16, 109–114 (1965)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  7. Karhumäki, J., Lifshits, Y., Rytter, W.: Tiling periodicity. Discrete Mathematics & Theoretical Computer Science 12(2), 237–248 (2010)

    MathSciNet  Google Scholar 

  8. Kopelowitz, T., Lewenstein, M.: Dynamic weighted ancestors. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 565–574. SIAM (2007)

    Google Scholar 

  9. Nekrich, Y., Navarro, G.: Sorted Range Reporting. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 271–282. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland

    Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter & Tomasz Waleń

  2. Faculty of Mathematics and Computer Science, Copernicus University, Toruń, Poland

    Wojciech Rytter

  3. Laboratory of Bioinformatics and Protein Engineering, International Institute of Molecular and Cell Biology in Warsaw, Poland

    Tomasz Waleń

Authors
  1. Tomasz Kociumaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Radoszewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tomasz Waleń
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Technologies Research Group, Universidad Autónoma de Bucaramanga, Bucaramanga, Colombia

    Liliana Calderón-Benavides

  2. Information Technologies and Research Group, Universidad Autónoma de Bucaramanga, Bucaramanga, Colombia

    Cristina González-Caro

  3. School of Physics and Mathematics, Universidad Michoacana, Edificio ”B”, Ciudad Universitaria,, 58000, Morelia, Mexico

    Edgar Chávez

  4. Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Pampulha, 31270-010, Belo Horizonte, Brazil

    Nivio Ziviani

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kociumaka, T., Radoszewski, J., Rytter, W., Waleń, T. (2012). Efficient Data Structures for the Factor Periodicity Problem. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds) String Processing and Information Retrieval. SPIRE 2012. Lecture Notes in Computer Science, vol 7608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34109-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34109-0_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34108-3

  • Online ISBN: 978-3-642-34109-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation