A palindromic factorization of a string w is a factorization of w consisting only of palindromic substrings of w. In this paper, we present an on-line O(n logn)-time O(n)-space algorithm to compute smallest palindromic factorizations of all prefixes of w, where n is the length of a given string w. We then show how to extend this algorithm to compute smallest maximal palindromic factorizations of all prefixes of w, consisting only of maximal palindromes (non-extensible palindromic substring) of each prefix, in O(n logn) time and O(n) space, in an on-line manner. We also present an on-line O(n)-time O(n)-space algorithm to compute a smallest palindromic cover of w. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
I, T., Sugimoto, S., Inenaga, S., Bannai, H., & Takeda, M. (2014). Computing palindromic factorizations and palindromic covers on-line. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8486, pp. 150–161). Springer Verlag. https://doi.org/10.1007/978-3-319-07566-2_16
Mendeley helps you to discover research relevant for your work.