Palindromic Length in Linear Time

Abstract

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, and a few O(n logn) time online algorithms were recently designed for it. In this paper we present the first linear time online algorithm for this problem. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G.2.1 Combinatorics

DOI: 10.4230/LIPIcs.CPM.2017.23

3 Figures and Tables

Cite this paper

@inproceedings{Borozdin2017PalindromicLI, title={Palindromic Length in Linear Time}, author={Kirill Borozdin and Dmitry Kosolobov and Mikhail Rubinchik and Arseny M. Shur}, booktitle={CPM}, year={2017} }