Palindrome pattern matching

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p) = Pals(t[i:i + m - 1]). We present linear-time algorithms to solve this problem.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings
PublisherSpringer Verlag
Pages232-245
Number of pages14
ISBN (Print)9783642214578
DOIs
Publication statusPublished - Jan 1 2011

Publication series

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

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

I, T., Inenaga, S., & Takeda, M. (2011). Palindrome pattern matching. In Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings (pp. 232-245). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6661). Springer Verlag. https://doi.org/10.1007/978-3-642-21458-5_21