File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Mining periodic patterns with gap requirement from sequences

TitleMining periodic patterns with gap requirement from sequences
Authors
Issue Date2005
PublisherAssociation 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?
AbstractWe 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 Identifierhttp://hdl.handle.net/10722/89177
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Men_HK
dc.contributor.authorKao, Ben_HK
dc.contributor.authorCheung, DWen_HK
dc.contributor.authorYip, KYen_HK
dc.date.accessioned2010-09-06T09:53:21Z-
dc.date.available2010-09-06T09:53:21Z-
dc.date.issued2005en_HK
dc.identifier.citationProceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 623-633en_HK
dc.identifier.issn0730-8078en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89177-
dc.description.abstractWe 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.languageengen_HK
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmoden_HK
dc.relation.ispartofProceedings of the ACM SIGMOD International Conference on Management of Dataen_HK
dc.rightsACM Transactions on Knowledge Discovery from Data. Copyright © Association for Computing Machinery, Inc.en_HK
dc.titleMining periodic patterns with gap requirement from sequencesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://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+Sequencesen_HK
dc.identifier.emailKao, B:kao@cs.hku.hken_HK
dc.identifier.emailCheung, DW:dcheung@cs.hku.hken_HK
dc.identifier.authorityKao, B=rp00123en_HK
dc.identifier.authorityCheung, DW=rp00101en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-29944442006en_HK
dc.identifier.hkuros135458en_HK
dc.identifier.hkuros103213-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-29944442006&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage623en_HK
dc.identifier.epage633en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridZhang, M=20434954000en_HK
dc.identifier.scopusauthoridKao, B=35221592600en_HK
dc.identifier.scopusauthoridCheung, DW=34567902600en_HK
dc.identifier.scopusauthoridYip, KY=7101909946en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats