Given two strings S and T, each of length at most n, the longest common substring (LCS)
problem is to find a longest substring common to S and T. This is a classical problem in …

A string UU for a non-empty string U is called a square. Squares have been well-studied
both from a combinatorial and an algorithmic perspective. In this paper, we are the first to …

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 …

In the longest common substring (LCS) problem, we are given two strings $ S $ and $ T $,
each of length at most $ n $, and we are asked to find a longest string occurring as a …

Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. It is known that the length of …

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 the problem of maintaining a collection of strings while efficiently supporting
splits and concatenations on them, as well as comparing two substrings, and computing the …

Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. Manacher [J. ACM 1975] …

In this paper we introduce a new family of string processing problems. We are given two or
more strings and we are asked to compute a factor common to all strings that preserves a …

We introduce a new family of string processing problems. Given two or more strings, we are
asked to compute a factor common to all strings that preserves a specific property and has …