@article{15, author = {Andrej Brodnik and Matevž Jekovec}, title = {Sliding Suffix Tree}, abstract = {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.}, year = {2018}, journal = {Algorithms}, volume = {11}, chapter = {118}, pages = {11}, month = {08/2011}, issn = {1999-4893}, url = {https://www.mdpi.com/1999-4893/11/8/118/pdf}, doi = {10.3390/a11080118}, }