TY - GEN

T1 - Counting and verifying maximal palindromes

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2010

Y1 - 2010

N2 - A palindrome is a symmetric string that reads the same forward and backward. Let pals(w) denote the set of maximal palindromes of a string w in which each palindrome is represented by a pair (c, r), where c is the center and r is the radius of the palindrome. We say that two strings w and z are pal-distinct if pals(w) ≠ pals(z). Firstly, we describe the number of pal-distinct strings, and show that we can enumerate all pal-distinct strings in time linear in the output size, for alphabets of size at most 3. These results follow from a close relationship between maximal palindromes and parameterized matching. Secondly, we present a linear time algorithm which finds a string w such that pals(w) is identical to a given set of maximal palindromes.

AB - A palindrome is a symmetric string that reads the same forward and backward. Let pals(w) denote the set of maximal palindromes of a string w in which each palindrome is represented by a pair (c, r), where c is the center and r is the radius of the palindrome. We say that two strings w and z are pal-distinct if pals(w) ≠ pals(z). Firstly, we describe the number of pal-distinct strings, and show that we can enumerate all pal-distinct strings in time linear in the output size, for alphabets of size at most 3. These results follow from a close relationship between maximal palindromes and parameterized matching. Secondly, we present a linear time algorithm which finds a string w such that pals(w) is identical to a given set of maximal palindromes.

UR - http://www.scopus.com/inward/record.url?scp=78449273752&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78449273752&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16321-0_13

DO - 10.1007/978-3-642-16321-0_13

M3 - Conference contribution

AN - SCOPUS:78449273752

SN - 3642163203

SN - 9783642163203

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 135

EP - 146

BT - String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings

PB - Springer Verlag

ER -