Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
431280 | Journal of Discrete Algorithms | 2014 | 8 Pages |
Abstract
We give an O(nlogn)O(nlogn)-time, O(n)O(n)-space algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string S[1..n]S[1..n], in O(nlogn)O(nlogn) time our algorithm returns the minimum number of palindromes S1,…,SℓS1,…,Sℓ such that S=S1⋯SℓS=S1⋯Sℓ. We also show that the time complexity is O(n)O(n) on average and Ω(nlogn)Ω(nlogn) in the worst case. The last result is based on a characterization of the palindromic structure of Zimin words.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa,