Computing Palindromic Trees for a Sliding Window and Its Applications

06/03/2020
by   Takuya Mieno, et al.
0

The palindromic tree (a.k.a. eertree) for a string S of length n is a tree-like data structure that represents the set of all distinct palindromic substrings of S, using O(n) space [Rubinchik and Shur, 2018]. It is known that, when S is over an alphabet of size σ and is given in an online manner, then the palindromic tree of S can be constructed in O(nlogσ) time with O(n) space. In this paper, we consider the sliding window version of the problem: For a fixed window length d, we propose two algorithms to maintain the palindromic tree of size O(d) for every sliding window S[i..i+d-1] over S, one running in O(nlogσ') time with O(d) space where σ' ≤ d is the maximum number of distinct characters in the windows, and the other running in O(n + dσ) time with dσ + O(d) space. We also present applications of our algorithms for computing minimal unique palindromic substrings (MUPS) and for computing minimal absent palindromic words (MAPW) for a sliding window.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2019

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window

A substring u of a string T is called a minimal unique substring (MUS) o...
research
01/23/2018

Sliding Suffix Tree

We consider a sliding window over a stream of characters from some finit...
research
07/04/2023

Sliding suffix trees simplified

Sliding suffix trees (Fiala Greene, 1989) for an input text T over a...
research
12/05/2017

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free

For many networking applications, recent data is more significant than o...
research
02/08/2021

Throwing a Sofa Through the Window

We study several variants of the problem of moving a convex polytope K, ...
research
11/19/2021

Real-time Coherency Identification using a Window-Size-Based Recursive Typicality Data Analysis

This work presents a data-driven analysis of minimal length necessary fo...
research
05/18/2021

Combinatorics of minimal absent words for a sliding window

A string w is called a minimal absent word (MAW) for another string T if...

Please sign up or login with your details

Forgot password? Click here to reset