For an undirected tree with n edges labelled by single letters, we consider its substrings,
which are labels of the simple paths between pairs of nodes. We prove that there are O (n …

We consider the problems of computing maximal palindromes and distinct palindromes in
an edge-labeled rooted tree where each edge is labeled by a single character. Such a tree …