String powers in trees
From MaRDI portal
Publication:1679231
DOI10.1007/S00453-016-0271-3zbMATH Open1380.68323DBLPjournals/algorithmica/KociumakaRRW17OpenAlexW2563726981WikidataQ59610504 ScholiaQ59610504MaRDI QIDQ1679231FDOQ1679231
Authors: Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Episturmian words and some constructions of de Luca and Rauzy
- Finding all periods and initial palindromes of a string in parallel
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- Algorithms on Strings
- Thue type problems for graphs, points, and numbers
- How many squares can a string contain?
- 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
- How many double squares can a string contain?
- On the maximum number of cubic subwords in a word
- Nonrepetitive colorings of trees
- Palindromic complexity of trees
- Efficient counting of square substrings in a tree
- Pattern Matching in Hypertext
- String Powers in Trees
- Tight bound for the number of distinct palindromes in a tree
Cited In (12)
- Efficiently computing runs on a trie
- Bounds on Powers in Strings
- Efficient counting of square substrings in a tree
- Lower bounds for the number of repetitions in 2D strings
- String covers of a tree
- Tight bound for the number of distinct palindromes in a tree
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
- The maximum number of squares in a tree
- Computing runs on a trie
- Title not available (Why is that?)
- String covers of a tree revisited
- String Powers in Trees
This page was built for publication: String powers in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679231)
