Skip to main content
SpringerLink
Log in

Linear-Time Computation of Local Periods

  • Conference paper
Mathematical Foundations of Computer Science 2003 (MFCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2747))

Abstract

We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM 20, 762–772 (1977)

    Article  Google Scholar 

  2. Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook on Formal Languages, vol. I, pp. 329–438. Springer, Heidelberg (1997)

    Google Scholar 

  3. Crochemore, M., Perrin, D.: Two-way string matching. J. ACM 38, 651–675 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)

    MATH  Google Scholar 

  5. Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13, 405–425 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters 12, 244–250 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Crochemore, M.: Recherche linéaire d’un carré dans un mot. Comptes Rendus Acad. Sci. Paris Sér. I Math. 296, 781–784 (1983)

    MATH  MathSciNet  Google Scholar 

  8. Duval, J.-P., Mignosi, F., Restivo, A.: Recurrence and periodicity in infinite words from local periods. Theoretical Computer Science 262(1), 269–284 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Duval, J.-P.: Périodes locales et propagation de périodes dans un mot. Theoretical Computer Science 204(1-2), 87–98 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Guibas, L.J., Odlyzko, A.M.: Periods in strings. Journal of Combinatorial Theory, Series A 30, 19–42 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  11. Galil, Z., Seiferas, J.: Time-space optimal string matching. Journal of Computer and System Sciences 26(3), 280–294 (1983)

    Article  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  13. Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. of FOCS 1999, pp. 596–604. IEEE Comp. Soc., New York (1999)

    Google Scholar 

  14. Kolpakov, R., Kucherov, G.: Finding repeats with fixed gap. In: Proc. of the 7th SPIRE, La Coruña, Spain, pp. 162–168. IEEE, Los Alamitos (2000)

    Google Scholar 

  15. Kolpakov, R., Kucherov, G.: Finding approximate repetitions under hamming distance. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 170–181. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing 6, 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kosaraju, S.R.: Computation of squares in string. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, pp. 146–150. Springer, Heidelberg (1994)

    Google Scholar 

  18. Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 17. Addison Wesley, Reading (1983)

    MATH  Google Scholar 

  19. Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  20. Main, M.G.: Detecting leftmost maximal periodicities. Discrete Applied Mathematics 25, 145–153 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  21. Main, M.G., Lorentz, R.J.: An O(n logn) algorithm for finding all repetitions in a string. Journal of Algorithms 5(3), 422–432 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  22. Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. Journal of the ACM 28(1), 16–24 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  23. Rivals, E., Rahmann, S.: Combinatorics of periods in strings. In: van Leuween, J., Orejas, P., Spirakis, P.G. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 615–626. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  24. Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, Rockville (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR, Université de Rouen, France

    Jean-Pierre Duval

  2. Department of Computer Science, University of Liverpool, UK

    Roman Kolpakov

  3. INRIA/LORIA, Nancy, France

    Gregory Kucherov

  4. ABISS, Université de Rouen, France

    Thierry Lecroq & Arnaud Lefebvre

Authors
  1. Jean-Pierre Duval
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Kolpakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gregory Kucherov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thierry Lecroq
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Arnaud Lefebvre
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 842 48, Bratislava, Slovakia

    Branislav Rovan

  2. Charles University, Prague, Czech Republic

    Peter Vojtáš

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duval, JP., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A. (2003). Linear-Time Computation of Local Periods. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45138-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40671-6

  • Online ISBN: 978-3-540-45138-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation