一种新的蛋白质序列模式挖掘算法  

Mining Algorithm for Protein Sequence Pattern

作　　者：郭顺[1] 姜青山[1] 王备战[1] 史亮[1] 

机构地区：[1]厦门大学软件学院,厦门361005

出　　处：《计算机工程》2009年第8期208-210,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(10771176);厦门大学校科研基金资助项目(0630-X0117)

摘　　要：针对传统模式挖掘方法挖掘蛋白质序列会生成大量候选模式或多次构造投影数据库,导致效率降低,挖掘过程中会产生不必要的短模式或错误模式等问题,提出基于模式划分的MBioPM算法。理论分析和实验表明,MBioPM算法的性能高于其他相关算法。Traditional algorithms face efficiency problem because of generating a huge number of candidates or constructing projected database many times. These algorithms will generate unnecessary short patterns or even wrong patterns in the process of mining. To attack these problems, a novel mining algorithm called Motif-divide based Biology sequence Pattern Mining（MBioPM） is presented based on ＂motif-divide＂ method. The MBioPM algorithm improves the efficience and avoids the problems mentioned above. Theoretical analysis and experimental results show that MBioPM algorithm improves performance as compared with other algorithm.

关 键 词：蛋白质序列 模式挖掘 数据挖掘 生物信息学 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]