Please use this identifier to cite or link to this item:
|Title:||Mining periodic patterns with gap requirement from sequences|
|Authors:||Zhang, M. |
|Source:||Zhang, M.,Kao, B.,Cheung, D.W.,Yip, K.Y. (2007). Mining periodic patterns with gap requirement from sequences. ACM Transactions on Knowledge Discovery from Data 1 (2). ScholarBank@NUS Repository. https://doi.org/10.1145/1267066.1267068|
|Abstract:||We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we consider P a frequently occurring pattern in S if the probability of observing P given a randomly picked length-l subsequence of S exceeds a certain threshold. In many applications, particularly those related to bioinformatics, interesting patterns are periodic with a gap requirement. That is to say, the characters in P should match subsequences of S in such a way that the matching characters in S are separated by gaps of more or less the same size. We show the complexity of the mining problem and discuss why traditional mining algorithms are computationally infeasible. We propose practical algorithms for solving the problem and study their characteristics. We also present a case study in which we apply our algorithms on some DNA sequences. We discuss some interesting patterns obtained from the case study. © 2007 ACM.|
|Source Title:||ACM Transactions on Knowledge Discovery from Data|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 12, 2017
checked on Dec 8, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.