Asymptotically Optimal Representation of Palindromic Structure
Data Structures and Algorithms
2025-12-01 v3
Abstract
We introduce an asymptotically optimal representation of the Manacher array of a string that supports constant-time access. The approach relies on the combinatorial properties of palindromes, yielding a compact yet efficient structure. This work fits within the broader study of compressed text indexing and highlights structural aspects of palindromic substrings that may inspire further algorithmic applications.
Keywords
Cite
@article{arxiv.2410.09984,
title = {Asymptotically Optimal Representation of Palindromic Structure},
author = {Michael Itzhaki},
journal= {arXiv preprint arXiv:2410.09984},
year = {2025}
}
Comments
Full version, accepted to SOFSEM26