Next Article in Journal
An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes
Next Article in Special Issue
DenseZDD: A Compact and Fast Index for Families of Sets
Previous Article in Journal
Research of the Vibration Source Tracking in Phase-Sensitive Optical Time-Domain Reflectometry Signals Based by Image Processing Method
Previous Article in Special Issue
Distributed Combinatorial Maps for Parallel Mesh Processing
Open AccessArticle

Sliding Suffix Tree

1
Faculty of Computer and Information Science, University of Ljubljana, 1000 Ljubljana, Slovenia
2
Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska, 6000 Koper-Capodistria, Slovenia
*
Author to whom correspondence should be addressed.
Algorithms 2018, 11(8), 118; https://doi.org/10.3390/a11080118
Received: 20 June 2018 / Revised: 20 July 2018 / Accepted: 25 July 2018 / Published: 3 August 2018
(This article belongs to the Special Issue Efficient Data Structures)
We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree. The data structure of size Θ(|W|) has optimal time queries Θ(m+occ) and amortized constant time updates, where m is the length of the query string and occ is its number of occurrences. View Full-Text
Keywords: suffix tree; online pattern matching; sliding window suffix tree; online pattern matching; sliding window
Show Figures

Figure 1

MDPI and ACS Style

Brodnik, A.; Jekovec, M. Sliding Suffix Tree. Algorithms 2018, 11, 118.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop