Abstract
We give an O(nlogn)-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(nlogn) 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 Ω(nlogn) in the worst case. The last result is based on a characterization of the palindromic structure of Zimin words.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
