4 Although we refer the reader to the source text for a full description of this data structure, its salient characteristic is that it implements priority queue operations insert and next-element in O(log log |T |) time.
the total running time for an algorithm to find all contiguous subpatterns and compute their collocations .