File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Mining periodic patterns with gap requirement from sequences
Title | Mining periodic patterns with gap requirement from sequences |
---|---|
Authors | |
Issue Date | 2005 |
Publisher | Association for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmod |
Citation | Proceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 623-633 How to Cite? |
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. Copyright 2005 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/89177 |
ISSN | 2023 SCImago Journal Rankings: 2.640 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, M | en_HK |
dc.contributor.author | Kao, B | en_HK |
dc.contributor.author | Cheung, DW | en_HK |
dc.contributor.author | Yip, KY | en_HK |
dc.date.accessioned | 2010-09-06T09:53:21Z | - |
dc.date.available | 2010-09-06T09:53:21Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Proceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 623-633 | en_HK |
dc.identifier.issn | 0730-8078 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/89177 | - |
dc.description.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. Copyright 2005 ACM. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Association for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmod | en_HK |
dc.relation.ispartof | Proceedings of the ACM SIGMOD International Conference on Management of Data | en_HK |
dc.rights | ACM Transactions on Knowledge Discovery from Data. Copyright © Association for Computing Machinery, Inc. | en_HK |
dc.title | Mining periodic patterns with gap requirement from sequences | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1556-4681&volume=1&spage=&epage=&date=2007&atitle=Mining+Periodic+Patterns+with+Gap+Requirement+from+Sequences | en_HK |
dc.identifier.email | Kao, B:kao@cs.hku.hk | en_HK |
dc.identifier.email | Cheung, DW:dcheung@cs.hku.hk | en_HK |
dc.identifier.authority | Kao, B=rp00123 | en_HK |
dc.identifier.authority | Cheung, DW=rp00101 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-29944442006 | en_HK |
dc.identifier.hkuros | 135458 | en_HK |
dc.identifier.hkuros | 103213 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-29944442006&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 623 | en_HK |
dc.identifier.epage | 633 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Zhang, M=20434954000 | en_HK |
dc.identifier.scopusauthorid | Kao, B=35221592600 | en_HK |
dc.identifier.scopusauthorid | Cheung, DW=34567902600 | en_HK |
dc.identifier.scopusauthorid | Yip, KY=7101909946 | en_HK |
dc.identifier.issnl | 0730-8078 | - |