DeepAI AI Chat
Log In Sign Up

Block Palindromes: A New Generalization of Palindromes

by   Keisuke Goto, et al.
Kyushu Institute of Technology

We propose a new generalization of palindromes and gapped palindromes called block palindromes. A block palindrome is a string 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.


page 1

page 2

page 3

page 4


Computing palindromes on a trie in linear time

A trie 𝒯 is a rooted tree such that each edge is labeled by a single cha...

Parameterized String Equations

We study systems of String Equations where block variables need to be as...

Maximal Closed Substrings

A string is closed if it has length 1 or has a nonempty border without i...

Generative Art Using Neural Visual Grammars and Dual Encoders

Whilst there are perhaps only a few scientific methods, there seem to be...

Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

In this paper, we study a certain case of a subgraph isomorphism problem...

Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space

Lcp-values, lcp-intervals, and maximal repeats are powerful tools in var...

INRU: A Quasigroup Based Lightweight Block Cipher

In this paper, we propose a quasigroup based block cipher design. The ro...