Periods and Quasiperiods Characterization

Authors:
Mireille Régnier;Laurent Mouchard
Affiliations:
-;-
Venue:
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Year:
2000

Citing 6
Cited 0

Optimal superprimitivity testing for strings

Information Processing Letters
An on-line string superprimitivity test

Information Processing Letters
Efficient detection of quasiperiodicities in strings

Theoretical Computer Science
Quasiperiodicity and string covering

Theoretical Computer Science
Quasiperiodicity: From detection to normal forms

Automatica (Journal of IFAC)
A unified approach to word occurrence probabilities

Discrete Applied Mathematics - Special volume on combinatorial molecular biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a new characterization of periods and quasiperiods that is constructive. It allows for a canonical partition of the set of borders of a given word w. Each subset of the partition contains a superprimitive border q and possibly quasiperiodic borders that admit q as a cover. Notably, we characterize superprimitive borders. A few enumeration results are given.