String Powers in Trees
From MaRDI portal
Publication:2942264
DOI10.1007/978-3-319-19929-0_24zbMATH Open1380.68322OpenAlexW2295790847MaRDI QIDQ2942264FDOQ2942264
Authors: Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń 
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
Recommendations
- String powers in trees
- Trees and Power-Sums
- Bounds on Powers in Strings
- Strings, trees, and patterns
- Stabilization of generic trees of strings
- Exploring string patterns with trees
- On inverse problem for tree of Stieltjes strings
- Directed trees in a string, real polynomials with triple roots, and chain mails
- More Trees and Power Sums
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
Cites Work
- Title not available (Why is that?)
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
- Internal pattern matching queries in a text and applications
- 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
- On the maximum number of cubic subwords in a word
- Nonrepetitive colorings of trees
- Efficient counting of square substrings in a tree
- Pattern Matching in Hypertext
Cited In (6)
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 Q2942264)
