... |C|l).Proof: The initialization takes time O(|C|l + win). In the recognition phase, again,there are O(n) shifts, and in each shift one event comes into the window and one event leaves the window. In one ... win time units.Reading the input takes time n. ✷Thistime boundcanbe contrasted withthetime usageofa trivialnon-incremental methodwhere the sequence is pre-processed into windows, and then frequent ... for.The time requirementforrecognizing |C|candidatesets inn windows,plus thetimerequiredto read in n windows of size win,isO(n|C|l+n·win), i.e., larger by a factor of win.Theorem 5. The time complexity...