Suffix Tree representing window should support O(1) updates (append tail, delete head).

This would allow implementation of various matching/search algorithms.