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.
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►▼ Show Figures
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
MDPI and ACS Style
Brodnik, A.; Jekovec, M. Sliding Suffix Tree. Algorithms 2018, 11, 118.
AMA StyleShow more citation formats Show less citations formats
Brodnik A, Jekovec M. Sliding Suffix Tree. Algorithms. 2018; 11(8):118.Chicago/Turabian Style
Brodnik, Andrej; Jekovec, Matevž. 2018. "Sliding Suffix Tree." Algorithms 11, no. 8: 118.
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.