Let T 1 and T 2 be two rooted trees with an equal number of leaves. The leaves are labeled,
and the labeling of the leaves in T 2 is a permutation of those in T 1. Nodes are associated …

We revisit the classic algorithmic problem of computing a longest palidromic substring. This
problem is solvable by a celebrated 𝒪 (n)-time algorithm [Manacher, J. ACM 1975], where n …

A palindrome is a string that reads the same forward and backward. A palindromic substring
w of a string T is called a minimal unique palindromic substring (MUPS) of T if w occurs only …

A palindromic substring T [i.. j] of a string T is said to be a shortest unique palindromic
substring (SUPS) in T for an interval [p, q] if T [i.. j] is a shortest one such that T [i.. j] occurs …

Palindromes are strings that read the same forward and backward. Problems of computing
palindromic structures in strings have been studied for many years with a motivation of their …

A palindromic substring T [i.. j] of a string T is said to be a shortest unique palindromic
substring (SUPS) in T for an interval [p, q] if T [i.. j] is a shortest palindromic substring such …

This paper investigates the (quasi-) periodicity of a string when the string is edited. A string $
C $ is called a cover (as known as a quasi-period) of a string $ T $ if each character of $ T …

Palindromes are strings that read the same forward and backward. Problems of computing
palindromic structures in strings have been studied for many years with the motivation of …

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 …