TY - JOUR AU - Andrej Brodnik AU - Matevž Jekovec AB - 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. IS - 8 M3 - Journal article N2 - 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. PY - 2018 SE - 118 EP - 11 T2 - Algorithms TI - Sliding Suffix Tree UR - https://www.mdpi.com/1999-4893/11/8/118/pdf VL - 11 SN - 1999-4893 ER -