A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences
文献类型：期刊论文
| 作者 | Jia, Caiyan1; Lu, Ruqian2,3,4 ; Chen, Lusheng3,4
|
| 刊名 | INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
 |
| 出版日期 | 2011-09-01 |
| 卷号 | 4期号:5页码:1032-1041 |
| 关键词 | Motif frequent pattern Apriori downward closure property |
| ISSN号 | 1875-6883 |
| 英文摘要 | Identification and characterization of gene regulatory binding motifs is one of the fundamental tasks toward systematically understanding the molecular mechanisms of transcriptional regulation. Recently, the problem has been abstracted as the challenge planted (l,d)-motif problem. Previous studies have developed numerous methods to solve the problem. But most of them need to specify the length l of a planted motif in advance and use depth first search strategy. In this study, we present an exact and efficient algorithm, called Apriori-Motif, without given the length l of a planted motif a priori. And a breadth first search strategy is used to prune search space quickly by the downward closure property utilized in Apriori, which is a classical algorithm for frequent pattern mining. Empirical study shows that Apriori-Motif is better than some existing methods. |
| 资助项目 | NSFC[60905029] ; NSFC[60875031] ; NSFC[90820013] ; 973 Project[2007CB311002] ; 973 Project[2009CB320701] |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000297797300026 |
| 出版者 | ATLANTIS PRESS |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/12070]  |
| 专题 | 数学所 |
| 通讯作者 | Jia, Caiyan |
| 作者单位 | 1.Beijing Jiaotong Univ, Dept Comp Sci, Beijing 100044, Peoples R China 2.Chinese Acad Sci, Inst Math, Beijing 100080, Peoples R China 3.Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China 4.Fudan Univ, Dept Comp Sci & Engn, Shanghai 200433, Peoples R China |
| 推荐引用方式 GB/T 7714 | Jia, Caiyan,Lu, Ruqian,Chen, Lusheng. A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS,2011,4(5):1032-1041. |
| APA | Jia, Caiyan,Lu, Ruqian,&Chen, Lusheng.(2011).A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences.INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS,4(5),1032-1041. |
| MLA | Jia, Caiyan,et al."A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences".INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 4.5(2011):1032-1041. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。