Block palindromes: A new generalization of palindromes

Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga

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

1 Citation (Scopus)


We study a new generalization of palindromes and gapped palindromes called block palindromes. A block palindrome is a string that becomes a palindrome when identical substrings are replaced with a distinct character. We investigate several properties of block palindromes and in particular, study substrings of a string which are block palindromes. In so doing, we introduce the notion of a maximal block palindrome, which leads to a compact representation of all block palindromes that occur in a string. We also propose an algorithm which enumerates all maximal block palindromes that appear in a given string T in O(|T|+||MBP(T)||) time, where ||MBP(T)|| is the output size, which is optimal unless all the maximal block palindromes can be represented in a more compact way.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings
EditorsTravis Gagie, Alistair Moffat, Ernesto Cuadros-Vargas, Gonzalo Navarro
PublisherSpringer Verlag
Number of pages8
ISBN (Print)9783030004781
Publication statusPublished - 2018
Event25th International Symposium on String Processing and Information Retrieval, SPIRE 2018 - Lima, Peru
Duration: Oct 9 2018Oct 11 2018

Publication series

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


Other25th International Symposium on String Processing and Information Retrieval, SPIRE 2018

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Block palindromes: A new generalization of palindromes'. Together they form a unique fingerprint.

Cite this