Data Structures for Computing Unique Palindromes in Static and Non-Static Strings

A palindromic substring T [ i .. j ] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [ p , q ] if T [ i .. j ] is a shortest palindromic substring such that T [ i .. j ] occurs only once in T , and [ i , j ] contains [ p , q ]. The SUPS problem is,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 86; číslo 3; s. 852 - 873
Hlavní autori:	Mieno, Takuya, Funakoshi, Mitsuru
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2024 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Constraints Data structures Data Structures and Information Theory Mathematics of Computing Preprocessing Queries Strings Theory of Computation Upper bounds String algorithms Palindromes Dynamic data structures Shortest unique palindromic substrings Range minimum queries Compact data structures
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!