### 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 | |

Publication status | Published - Jan 1 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 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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