The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining Workshops (2006)
Hong Kong, China
Dec. 18, 2006 to Dec. 22, 2006
ISBN: 0-7695-2702-7
pp: 94-98
Gary Benson , Boston University
Panagiotis Papapetrou , Boston University
George Kollios , Boston University
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient algorithms are proposed. The first one is entropy-based and uses an existing recursive segmentation technique to split the input sequence into a set of homogeneous segments. The key idea of the second approach is to use a set of sliding windows over the sequence. Each sliding window keeps a set of statistics of a sequence segment that mainly includes the number of occurrences of each item in that segment. Combining these statistics efficiently yields the complete set of regions of high occurrence of the items of the given alphabet. After identifying these regions, the sequence is converted to a sequence of labeled intervals (each one corresponding to a region). An efficient algorithm for mining frequent arrangements of event intervals is applied to the converted sequence to discover frequently occurring arrangements of these regions. The proposed algorithms are tested on various DNA sequences producing results with significant biological meaning.
Gary Benson, Panagiotis Papapetrou, George Kollios, "Discovering Frequent Poly-Regions in DNA Sequences", 2013 IEEE 13th International Conference on Data Mining Workshops, vol. 00, no. , pp. 94-98, 2006, doi:10.1109/ICDMW.2006.63
108 ms
(Ver 3.3 (11022016))