A subquadratic algorithm for minimum palindromic factorization

We give an O(nlog⁡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(nlog⁡n) time our algorithm returns the minimum number of palindromes S1,…,Sℓ such that S=S1⋯Sℓ. We also show that the time complexity is O(n...

Full description

Saved in:
Bibliographic Details
Published in:Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 28; pp. 41 - 48
Main Authors: Fici, Gabriele, Gagie, Travis, Kärkkäinen, Juha, Kempa, Dominik
Format: Journal Article
Language:English
Published: Elsevier B.V 01.09.2014
Subjects:
Factorization
Palindromes
String algorithms
String algorithms
Palindromes
Factorization
ISSN:1570-8667, 1570-8675
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give an O(nlog⁡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(nlog⁡n) time our algorithm returns the minimum number of palindromes S1,…,Sℓ such that S=S1⋯Sℓ. We also show that the time complexity is O(n) on average and Ω(nlog⁡n) in the worst case. The last result is based on a characterization of the palindromic structure of Zimin words.
ISSN:1570-8667
1570-8675
DOI:10.1016/j.jda.2014.08.001