Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 5 - Regularities inWords

  • Maxime Crochemore, Thierry Lecroq, Wojciech Rytter
  • Book:
    125 Problems in Text Algorithms
    Published online:
    10 June 2021
    Print publication:
    01 July 2021, pp 180-229

  • Summary

    The chapter is concerned with regularities that occur in texts, in particular repetitions and symmetries. They have a strong influence on the efficiency of algorithms. The central topic is the notion of repetition of factors: squares, cubes, maximal periodicities or runs, and overlaps. Problems deal with discovering or counting of repetitions. The related algorithms are usually short but tricky. Especially problems about runs are non-trivial but show the unexpected power of combinatorics of Lyndon words. Repetitions in labeled trees are also considered. Besides repetitions some problems deal with symmetrical words (palindromes) and anti-power words.