Counting and verifying maximal palindromes

Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda

doi:10.1007/978-3-642-16321-0_13

Counting and verifying maximal palindromes

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings
Publisher	Springer Verlag
Pages	135-146
Number of pages	12
ISBN (Print)	3642163203, 9783642163203
DOIs	https://doi.org/10.1007/978-3-642-16321-0_13
Publication status	Published - 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6393
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

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

Cite this

I, T., Inenaga, S., Bannai, H., & Takeda, M. (2010). Counting and verifying maximal palindromes. In String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings (pp. 135-146). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6393). Springer Verlag. https://doi.org/10.1007/978-3-642-16321-0_13

Counting and verifying maximal palindromes. / I, Tomohiro; Inenaga, Shunsuke; Bannai, Hideo et al.
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Springer Verlag, 2010. p. 135-146 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6393).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

I, T, Inenaga, S, Bannai, H & Takeda, M 2010, Counting and verifying maximal palindromes. in String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6393, Springer Verlag, pp. 135-146. https://doi.org/10.1007/978-3-642-16321-0_13

I T, Inenaga S, Bannai H, Takeda M. Counting and verifying maximal palindromes. In String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Springer Verlag. 2010. p. 135-146. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-16321-0_13

I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo et al. / Counting and verifying maximal palindromes. String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Springer Verlag, 2010. pp. 135-146 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{904e5cba55314e3e88b4b223456b4ec2,

title = "Counting and verifying maximal palindromes",

abstract = "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.",

author = "Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",

year = "2010",

doi = "10.1007/978-3-642-16321-0_13",

language = "English",

isbn = "3642163203",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "135--146",

booktitle = "String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings",

address = "Germany",

}

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 -

Counting and verifying maximal palindromes

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this