Sliding Suffix Tree
Faculty of Computer and Information Science, University of Ljubljana, 1000 Ljubljana, Slovenia
Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska, 6000 Koper-Capodistria, Slovenia
Author to whom correspondence should be addressed.
Received: 20 June 2018 / Revised: 20 July 2018 / Accepted: 25 July 2018 / Published: 3 August 2018
PDF [446 KB, uploaded 3 August 2018]
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
has optimal time queries
and amortized constant time updates, where m
is the length of the query string and
is its number of occurrences.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Brodnik, A.; Jekovec, M. Sliding Suffix Tree. Algorithms 2018, 11, 118.
Brodnik A, Jekovec M. Sliding Suffix Tree. Algorithms. 2018; 11(8):118.
Brodnik, Andrej; Jekovec, Matevž. 2018. "Sliding Suffix Tree." Algorithms 11, no. 8: 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.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.