String Powers in Trees
From MaRDI portal
Publication:2942264
DOI10.1007/978-3-319-19929-0_24zbMath1380.68322OpenAlexW2295790847MaRDI QIDQ2942264
Tomasz Kociumaka, Jakub Radoszewski, Tomasz Walen, Wojciech Rytter
Publication date: 20 August 2015
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_24
Related Items (1)
Cites Work
- Unnamed Item
- 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
- 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
- Pattern Matching in Hypertext
- Internal Pattern Matching Queries in a Text and Applications
- Algorithms on Strings
This page was built for publication: String Powers in Trees
