Linear-time computation of local periods
type: Item
instance of: scholarly article
title: Linear-time computation of local periods
zbMATH Open document ID: 1071.68087
author: J.-P. Duval
author: Gregory Kucherov
author: Thierry Lecroq
author: A. Lefebvre
author: Roman Kolpakov
published in: Theoretical Computer Science
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 2126114
zbMATH Keywords: Word
zbMATH Keywords: Period
zbMATH Keywords: Local period
zbMATH Keywords: Algorithm
zbMATH Keywords: Complexity
zbMATH Keywords: String matching
MaRDI profile type: Publication
Wikidata QID: Q58064522
full work available at URL: j.tcs.2004.06.024
OpenAlex ID: W2123234403
cites work: Q4173569
cites work: Q4714446
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Q3673134
cites work: Two-way string-matching
cites work: Q4849531
cites work: Squares, cubes, and time-space efficient string searching
cites work: Q2723970
cites work: Periodes et repetitions des mots du monoide libre
cites work: Périodes locales et propagation de périodes dans un mot
cites work: Recurrence and periodicity in infinite words from local periods
cites work: How many squares can a string contain?
cites work: Time-space-optimal string matching
cites work: Periods in strings
cites work: Algorithms on Strings, Trees and Sequences
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Fast Pattern Matching in Strings
cites work: Q4796175
cites work: Q3659988
cites work: Q4529547
cites work: Detecting leftmost maximal periodicities
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: A periodicity theorem on words and applications
cites work: Q4535051
cites work: Linear Algorithm for Data Compression via String Matching
DBLP publication ID: journals/tcs/DuvalKKLL04
DOI: 10.1016/J.TCS.2004.06.024
description: scientific article; zbMATH DE number 2126114