String powers in trees
type: Item
instance of: scholarly article
title: String powers in trees
zbMATH Open document ID: 1380.68323
author: Tomasz Kociumaka
author: Jakub Radoszewski
author: Wojciech Rytter
author: Tomasz Waleń
published in: Algorithmica
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6804039
zbMATH Keywords: repetitions
zbMATH Keywords: cubes
zbMATH Keywords: labeled trees
zbMATH Keywords: squares
zbMATH Keywords: periodicities
zbMATH Keywords: combinatorics on words
Wikidata QID: Q59610504
MaRDI profile type: Publication
full work available at URL: s00453-016-0271-3
OpenAlex ID: W2563726981
cites work: Pattern Matching in Hypertext
cites work: Finding all periods and initial palindromes of a string in parallel
cites work: Nonrepetitive colorings of trees
cites work: Palindromic Complexity of Trees
cites work: Algorithms on Strings
cites work: The Maximum Number of Squares in a Tree
cites work: How many double squares can a string contain?
cites work: Episturmian words and some constructions of de Luca and Rauzy
cites work: How many squares can a string contain?
cites work: Tight bound for the number of distinct palindromes in a tree
cites work: Thue type problems for graphs, points, and numbers
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: Efficient counting of square substrings in a tree
cites work: Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
cites work: String Powers in Trees
cites work: On the maximum number of cubic subwords in a word
cites work: Q4341774
DBLP publication ID: journals/algorithmica/KociumakaRRW17
DOI: 10.1007/S00453-016-0271-3
description: scientific article; zbMATH DE number 6804039