Double-ended palindromic trees in linear time

The palindromic tree (a.k.a. eertree) is a data structure that provides access to all palindromic substrings of a string. In this paper, we propose a dynamic version of eertree, called double-ended eertree, which supports online operations on the stored string, including double-ended queue operation...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 307; p. 105379
Main Authors:	Wang, Qisheng, Yang, Ming, Zhu, Xinrui
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2025
Subjects:	Double-ended data structures Eertrees Palindromes String algorithms Palindromes String algorithms Eertrees Double-ended data structures
ISSN:	0890-5401
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!