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

Uloženo v:
Podrobná bibliografie
Vydáno v:Information and computation Ročník 307; s. 105379
Hlavní autoři: Wang, Qisheng, Yang, Ming, Zhu, Xinrui
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.11.2025
Témata:
Double-ended data structures
Eertrees
Palindromes
String algorithms
Palindromes
String algorithms
Eertrees
Double-ended data structures
ISSN:0890-5401
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 operations, counting distinct palindromic substrings, and finding the longest palindromic prefix/suffix. At the heart of our construction, we identify a new class of substring occurrences, called surfaces, that are palindromic substring occurrences that are neither prefixes nor suffixes of any other palindromic substring occurrences, which is of independent interest. Surfaces characterize the link structure of all palindromic substrings in the eertree, thereby allowing a linear-time implementation of double-ended eertrees through a linear-time maintenance of surfaces.
ISSN:0890-5401
DOI:10.1016/j.ic.2025.105379