Maximal repetitions in strings
type: Item
instance of: scholarly article
title: Maximal repetitions in strings
zbMATH Open document ID: 1149.68066
author: Maxime Crochemore
author: Lucian Ilie
published in: Journal of Computer and System Sciences
publication date: 2008-06-26T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5293390
zbMATH Keywords: combinatorics on words
zbMATH Keywords: repetitions in strings
zbMATH Keywords: runs
zbMATH Keywords: maximal repetitions
zbMATH Keywords: maximal periodicities
zbMATH Keywords: sum of exponents
MaRDI profile type: Publication
Wikidata QID: Q61677921
full work available at URL: j.jcss.2007.09.003
OpenAlex ID: W2014277465
cites work: Optimal off-line detection of repetitions in a string
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Squares, cubes, and time-space efficient string searching
cites work: How many squares can a string contain?
cites work: A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
cites work: A note on the number of squares in a word
cites work: A characterization of the squares in a Fibonacci string
cites work: Q4934345
cites work: Q4529547
cites work: Q4681771
cites work: Detecting leftmost maximal periodicities
cites work: How many runs can a string contain?
cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
DOI: 10.1016/J.JCSS.2007.09.003
DBLP publication ID: journals/jcss/CrochemoreI08
description: scientific article; zbMATH DE number 5293390