Finding Pseudo-repetitions

Authors Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu

Thumbnail PDF


  • Filesize: 0.58 MB
  • 12 pages

Document Identifiers

Author Details

Pawel Gawrychowski
Florin Manea
Robert Mercas
Dirk Nowotka
Catalin Tiseanu

Cite AsGet BibTex

Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, and Catalin Tiseanu. Finding Pseudo-repetitions. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 257-268, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences. We solve fundamental algorithmic questions on pseudo-repetitions by application of insightful combinatorial results on words. More precisely, we efficiently decide whether a word is a pseudo-repetition and find all the pseudo-repetitive factors of a word.
  • Stringology
  • Pattern matching
  • Repetition
  • Pseudo-repetition


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads