Papapetrou, Panagiotis; Benson, Gary; Kollios, George
(Boston University Computer Science Department, 2008-10-21)
The problem of discovering frequent poly-regions (i.e. regions of high occurrence of a set of items or patterns of a given alphabet) in a sequence is studied, and three efficient approaches are proposed to solve it. The ...