We give an -time, -space algorithm for factoring a string into the minimum number of palindromic substrings.

Mar 10, 2014 · We give an \mathcal{O}(n \log n)-time, \mathcal{O}(n)-space algorithm for factoring a string into the minimum number of palindromic substrings.

We give an $\mathcal{O}(n \log n)$-time, $\mathcal{O}(n)$-space algorithm for factoring a string into the minimum number of palindromic substrings.

Abstract:We give an \mathcal{O}(n \log n)-time, \mathcal{O}(n)-space algorithm for factoring a string into the minimum number of palindromic substrings.

We give an O ( n log ź n ) -time, O ( n ) -space algorithm for factoring a string into the minimum number of palindromic substrings.

This work revisits the classic algorithmic problem of computing a longest palidromic substring and devise a simple O ( n log σ/ log n )-time algorithm that ...

We give an $O(n \log n)$ time algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string \(S [1..n]\), ...

These are the first algorithms that achieve running times polynomial in the size of the compressed input and output representations of $T$. Since most of the ...

This document summarizes an O(n log n)-time and O(n)-space algorithm for factoring a string into the minimum number of palindromic substrings.

This document summarizes an O(n log n)-time and O(n)-space algorithm for factoring a string into the minimum number of palindromic substrings.