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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 307; S. 105379
Hauptverfasser:	Wang, Qisheng, Yang, Ming, Zhu, Xinrui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.11.2025
Schlagworte:	Double-ended data structures Eertrees Palindromes String algorithms Palindromes String algorithms Eertrees Double-ended data structures
ISSN:	0890-5401
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!