A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs

M. Hayashida, T. Akutsu, H. Nagamochi
{"title":"A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs","authors":"M. Hayashida, T. Akutsu, H. Nagamochi","doi":"10.2197/IPSJDC.4.207","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel clustering method based on graph theory for analysis of biological networks. In this method, each biological network is treated as an undirected graph and edges are weighted based on similarities of nodes. Then, maximal components, which are defined based on edge connectivity, are computed and the nodes are partitioned into clusters by selecting disjoint maximal components. The proposed method was applied to clustering of protein sequences and was compared with conventional clustering methods. The obtained clusters were evaluated using P-values for GO(GeneOntology) terms. The average P-values for the proposed method were better than those for other methods.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ipsj Digital Courier","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2197/IPSJDC.4.207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a novel clustering method based on graph theory for analysis of biological networks. In this method, each biological network is treated as an undirected graph and edges are weighted based on similarities of nodes. Then, maximal components, which are defined based on edge connectivity, are computed and the nodes are partitioned into clusters by selecting disjoint maximal components. The proposed method was applied to clustering of protein sequences and was compared with conventional clustering methods. The obtained clusters were evaluated using P-values for GO(GeneOntology) terms. The average P-values for the proposed method were better than those for other methods.
利用图的极大分量分析蛋白质序列相似网络的聚类方法
提出了一种基于图论的生物网络聚类分析方法。该方法将每个生物网络视为一个无向图,并根据节点的相似度对边缘进行加权。然后,计算基于边缘连通性定义的极大分量,并通过选取不相交的极大分量对节点进行聚类;将该方法应用于蛋白质序列的聚类,并与传统的聚类方法进行了比较。使用GO(GeneOntology)术语的p值对获得的聚类进行评估。该方法的平均p值优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信