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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 86; no. 3; pp. 852 - 873
Main Authors:	Mieno, Takuya, Funakoshi, Mitsuru
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2024 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!