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 …

It is known that all maximal palindromes of a given string T of length n can be computed in O
(n) time by Manacher's algorithm [J. ACM'75]. Also, all distinct palindromes in T can be …

We consider covering labeled trees by a collection of paths with the same string label, called
a (string) cover of a tree. We show how to compute all covers of a directed (rooted) labeled …

A trie $\mathcal {T} $ is a rooted tree such that each edge is labeled by a single character
from the alphabet, and the labels of out-going edges from the same node are mutually …

In this paper we consider substrings of an unrooted edge-labeled tree, which are defined as
the composite labels of simple paths. We study how the number of distinct repetitive …

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 …

The palindromic tree (aka eertree) is a linear-size data structure that provides access to all
palindromic substrings of a string. In this paper, we propose a generalized version of …

We consider covering labeled trees with a collection of paths with the same string label,
called a (string) cover of a tree. This problem was originated by Radoszewski et al.(SPIRE …

In recent years, with the spread of the Internet, the development of sensor technology, and
the widespread use of mobile devices, an enormous amount of diverse data has been …

We consider covering labeled trees by a collection of paths with the same string label, called
a (string) cover of a tree. We show how to compute all covers of a directed (rooted) labeled …