Abstrakt
Suffix tree is a powerful data structure developed originally for string matching and searching. Numerous applications need a suffix tree built for a sliding window and there are classical algorithms of Fiala and Greene and Larsson that make it possible, however, both have flawed correctness proofs.
We remedy this situation both by explaining a simple alternative and giving a correct proof.