论文信息 - Palindromic Length in Linear Time

Palindromic Length in Linear Time

Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to this string. The problem of finding the palindromic length drew some attention, and a few O(n log n) time online algorithms were recently designed for it. In this paper we present the first linear time online algorithm for this problem.

[1] Arseny M. Shur,et al. EERTREE: An efficient data structure for processing palindromes in strings , 2015, Eur. J. Comb..

[2] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[3] Juha Kärkkäinen,et al. A subquadratic algorithm for minimum palindromic factorization , 2014, J. Discrete Algorithms.

[4] 英哉岩崎. 20世紀の名著名論：D. E. Knuth J. H. Morris V. R. Pratt : Fast pattern matching in Strings , 2004 .

[5] Zvi Galil,et al. A Linear-Time On-Line Recognition Algorithm for ``Palstar'' , 1978, JACM.

[6] Juha Kärkkäinen,et al. Fast Lightweight Suffix Array Construction and Checking , 2003, CPM.

[7] Glenn K. Manacher,et al. A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String , 1975, JACM.

[8] A. O. Slisenko. A simplified proof of the real-time recognizability of palindromes on turing machines , 1981 .