Tight bound for the number of distinct palindromes in a tree

DOI10.37236/10842zbMath1523.68050arXiv2008.13209MaRDI QIDQ6042101

Tomasz Kociumaka, Tomasz Walen, Paweł Gawrychowski, Wojciech Rytter

Publication date: 16 May 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.13209

Mathematics Subject Classification ID

Trees (05C05) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (1)

String powers in trees

Cites Work

• Unnamed Item
• Palindromes in circular words
• Counting distinct palindromes in a word in linear time
• The level ancestor problem simplified
• Palindromic richness
• Total palindrome complexity of finite words
• String powers in trees
• Computing longest palindromic substring after single-character or block-wise edits
• Efficient counting of square substrings in a tree
• Deterministic Dictionaries
• The Maximum Number of Squares in a Tree
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Fast Algorithms for Finding Nearest Common Ancestors
• Universal Reconstruction of a String
• Palindromic Complexity of Trees
• Jewels of Stringology
• Uniqueness Theorems for Periodic Functions
• Palindromes in starlike trees
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Tight bound for the number of distinct palindromes in a tree