Detecting leftmost maximal periodicities (Q1825029): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:49, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Detecting leftmost maximal periodicities |
scientific article |
Statements
Detecting leftmost maximal periodicities (English)
0 references
1989
0 references
A periodicity is a word of the form \(p^ mq\), where q is a prefix of p and \(m\geq 2\). The author gives an efficient algorithm to list the leftmost occurrences of periodicities within a string. This algorithm is linear in time, when the alphabet is known in advance, and of the order O(\(| x| \log | x|)\), if not, where x is the input string. As an application, the author solves several questions raised by Crochemore
0 references
periodic words
0 references