吉林大学学报(工学版) ›› 2010, Vol. 40 ›› Issue (05): 1318-1323.
李 敏, 王建新, 陈建二
LI Min,WANG Jian-xin,CHEN Jian-er
摘要:
The number of known complexes recalled by the existing algorithms of clustering in proteinprotein interaction network is very limited. To solve this problem, a new distance measurebased algorithm for identification of protein complexes, named IPCDM, is proposed based on our discovery that most of the shortest paths between proteins complexes are no more than two. A new seedextension model is also proposed to improve the precision of protein complexes discovery. Experiment results on yeast protein interaction network show that more known protein complexes are recalled by IPCDM than by other typical algorithms: MCODE, ENSC, CFinder, LCMA and DPClus.
中图分类号:
[1] | 金玉善, 郭凯, 杨书范, 黄永平. 嵌入式系统测量中的指数平滑滤波新算法[J]. 吉林大学学报(工学版), 2012, 42(增刊1): 314-316. |
[2] | 游晓明, 刘升, 王裕明. 量子行为网络资源并行分配优化模型及其应用[J]. 吉林大学学报(工学版), 2012, 42(增刊1): 341-345. |
[3] | 窦全胜, 潘冠宇, 刘岩, 周春光, 史忠植. PSO的向量整体修订策略和局部跳出策略[J]. 吉林大学学报(工学版), 2012, 42(02): 429-433. |
[4] | 陈纯毅1,2,杨华民2,李文辉1,范静涛2. 线索化包围盒层次结构的并行创建算法[J]. 吉林大学学报(工学版), 2011, 41(05): 1388-1393. |
|