论文信息 - Finding Distinct Subpalindromes Online

Finding Distinct Subpalindromes Online

We exhibit an online algorithm finding all distinct palindromes inside a given string in time $\Theta(n\log|\Sigma|)$ over an ordered alphabet and in time $\Theta(n|\Sigma|)$ over an unordered alphabet. Using a reduction from a dictionary-like data structure, we prove the optimality of this algorithm in the comparison-based computation model.

Arseny M. Shur | Dmitry Kosolobov | Mikhail Rubinchik

[1] Giuseppe Pirillo,et al. Episturmian words and some constructions of de Luca and Rauzy , 2001, Theor. Comput. Sci..

[2] Gwénaël Richomme,et al. Counting distinct palindromes in a word in linear time , 2010, Inf. Process. Lett..

[3] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.

[4] Wojciech Rytter,et al. Jewels of stringology , 2002 .

[5] Aldo de Luca,et al. Sturmian Words: Structure, Combinatorics, and Their Arithmetics , 1997, Theor. Comput. Sci..

[6] Luca Q. Zamboni,et al. Palindromic richness , 2008, Eur. J. Comb..

[7] Giuseppe Pirillo,et al. Palindromes and Sturmian Words , 1999, Theor. Comput. Sci..

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