We propose a new linear-size data structure which provides a fast access to all palindromic
substrings of a string or a set of strings. This structure inherits some ideas from the …

We give an O (n log⁡ n)-time, O (n)-space algorithm for factoring a string into the minimum
number of palindromic substrings. That is, given a string S [1.. n], in O (n log⁡ n) time our …

Palindromic length of a string is the minimum number of palindromes whose concatenation
is equal to this string. The problem of finding the palindromic length drew some attention …

We propose a data structure and an online algorithm to report the number of distinct
palindromes in any substring of an input string. Assume that the string S of length n arrives …

A degenerate symbol over an alphabet Σ is a non-empty subset of Σ, and a sequence of
such symbols is a degenerate string. We investigate the exact computation of maximal …

Diverse Palindromic Factorization Is NP-complete Page 1 Diverse Palindromic Factorization Is
NP-complete Hideo Bannai1, Travis Gagie2,3(B), Shunsuke Inenaga1, Juha Kärkkäinen2 …

A length n word is (palindromic) rich if it contains the maximum possible number, which is n,
of distinct non-empty palindromic factors. We prove both necessary and sufficient conditions …

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 …

arxiv:1503.09112v1 [cs.FL] 31 Mar 2015 Page 1 arxiv:1503.09112v1 [cs.FL] 31 Mar 2015 On
the Combinatorics of Palindromes and Antipalindromes Chuan Guo1, Jeffrey Shallit1, and …

Identifying palindromes in sequences has been an interesting line of research in
combinatorics on words and also in computational biology, after the discovery of the relation …