AI Chat AI Image Generator AI Video Text to Speech

Sliding Suffix Tree

01/23/2018

∙

by Andrej Brodnik, et al.

∙

∙

We consider a sliding window over a stream of characters from some finite alphabet. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an indexed version of the sliding window based on a suffix tree. The data structure has optimal time queries Θ(m+occ) and amortized constant time updates, where m is the length of the query string and occ the number of occurrences.

Andrej Brodnik
6 publications
Matevž Jekovec
1 publication

page 1

page 2

page 3

page 4

research

∙ 06/03/2020

Computing Palindromic Trees for a Sliding Window and Its Applications

The palindromic tree (a.k.a. eertree) for a string S of length n is a tr...

0 Takuya Mieno, et al. ∙

research

∙ 01/23/2023

Sliding Window String Indexing in Streams

Given a string S over an alphabet Σ, the 'string indexing problem' is to...

0 Philip Bille, et al. ∙

research

∙ 05/14/2023

Dynamic Convex Hulls under Window-Sliding Updates

We consider the problem of dynamically maintaining the convex hull of a ...

0 Haitao Wang, et al. ∙

research

∙ 09/14/2018

Approximate Query Processing over Static Sets and Sliding Windows

Indexing of static and dynamic sets is fundamental to a large set of app...

0 Ran Ben Basat, et al. ∙

research

∙ 01/23/2017

Segmentation-free Vehicle License Plate Recognition using ConvNet-RNN

While vehicle license plate recognition (VLPR) is usually done with a sl...

0 Teik Koon Cheang, et al. ∙

research

∙ 02/02/2019

Efficient estimation of AUC in a sliding window

In many applications, monitoring area under the ROC curve (AUC) in a sli...

0 Nikolaj Tatti, et al. ∙

research

∙ 04/26/2021

A Sliding-Window Approach to Automatic Creation of Meeting Minutes

Meeting minutes record any subject matters discussed, decisions reached ...

0 Jia Jin Koay, et al. ∙