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

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 307; s. 105379
Hlavní autori:	Wang, Qisheng, Yang, Ming, Zhu, Xinrui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.11.2025
Predmet:	Double-ended data structures Eertrees Palindromes String algorithms Palindromes String algorithms Eertrees Double-ended data structures
ISSN:	0890-5401
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!