String powers in trees
From MaRDI portal
Publication:1679231
DOI10.1007/s00453-016-0271-3zbMath1380.68323OpenAlexW2563726981WikidataQ59610504 ScholiaQ59610504MaRDI QIDQ1679231
Tomasz Kociumaka, Wojciech Rytter, Jakub Radoszewski, Tomasz Walen
Publication date: 9 November 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0271-3
Related Items (5)
Efficiently computing runs on a trie ⋮ String covers of a tree ⋮ Lower bounds for the number of repetitions in 2D strings ⋮ Tight bound for the number of distinct palindromes in a tree ⋮ Computing runs on a trie
Cites Work
- Unnamed Item
- How many double squares can a string contain?
- Nonrepetitive colorings of trees
- Thue type problems for graphs, points, and numbers
- How many squares can a string contain?
- On the maximum number of cubic subwords in a word
- Finding all periods and initial palindromes of a string in parallel
- Efficient counting of square substrings in a tree
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- The Maximum Number of Squares in a Tree
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- String Powers in Trees
- Palindromic Complexity of Trees
- Pattern Matching in Hypertext
- Algorithms on Strings
- Episturmian words and some constructions of de Luca and Rauzy
- Tight bound for the number of distinct palindromes in a tree
This page was built for publication: String powers in trees
