Comparison of Protein Complexes Predicted from PPI Networks by DPClus and Newman Clustering Algorithms

• Item type: Trans(1)
• 公開日: 2006-11-15
• タイトル: Comparison of Protein Complexes Predicted from PPI Networks by DPClus and Newman Clustering Algorithms
• タイトル / 言語: en
• タイトル: Comparison of Protein Complexes Predicted from PPI Networks by DPClus and Newman Clustering Algorithms
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: Original Papers
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Bioinformatics and Genomics Graduate School of Information Science Nara Institute of Science and Technology
• 著者所属: Department of Bioinformatics and Genomics Graduate School of Information Science Nara Institute of Science and Technology
• 著者所属: Department of Computational Biology Graduate School of Frontier Sciences the University of Tokyo
• 著者所属: Department of Computational Biology Graduate School of Frontier Sciences the University of Tokyo
• 著者所属: Department of Bioinformatics and Genomics Graduate School of Information Science Nara Institute of Science and Technology
• 著者所属: Department of Bioinformatics and Genomics Graduate School of Information Science Nara Institute of Science and Technology
• 著者所属: Department of Bioinformatics and Genomics Graduate School of Information Science Nara Institute of Science and Technology
• 著者所属(英): en
• 著者所属(英): Department of Bioinformatics and Genomics, Graduate School of Information Science, Nara Institute of Science and Technology
• 著者所属(英): en
• 著者所属(英): Department of Bioinformatics and Genomics, Graduate School of Information Science, Nara Institute of Science and Technology
• 著者所属(英): en
• 著者所属(英): Department of Computational Biology, Graduate School of Frontier Sciences, the University of Tokyo
• 著者所属(英): en
• 著者所属(英): Department of Computational Biology, Graduate School of Frontier Sciences, the University of Tokyo
• 著者所属(英): en
• 著者所属(英): Department of Bioinformatics and Genomics, Graduate School of Information Science, Nara Institute of Science and Technology
• 著者所属(英): en
• 著者所属(英): Department of Bioinformatics and Genomics, Graduate School of Information Science, Nara Institute of Science and Technology
• 著者所属(英): en
• 著者所属(英): Department of Bioinformatics and Genomics, Graduate School of Information Science, Nara Institute of Science and Technology
• 著者名: Hisashi, Tuji; Md.Altaf-Ul-Amin; Masanori, Arita; Hirokazu, Nishio; Yoko, Shinbo; Ken, Kurokawa; Shigehiko, Kanaya
• 著者名(英): Hisashi, Tuji; Md., Altaf-Ul-Amin; Masanori, Arita; Hirokazu, Nishio; Yoko, Shinbo; Ken, Kurokawa; Shigehiko, Kanaya
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: A Protein-Protein Interaction network what we call a PPI network is considered as an important source of information for prediction of protein functions. However it is quite difficult to analyze such networks for their complexity. We expected that if we could develop a good visualizing method for PPI networks we could predict protein functions visually because of the close relation between protein functions and protein interactions. Previously we proposed one which is based on clustering concepts by extracting clusters defined as relatively densely connected group of nodes. But the results of visualization of a network differ very much depending on the clustering algorithm. Therefore in this paper we compare the outcome of two different clustering algorithms namely DPClus and Newman algorithms by applying them to a PPI network and point out some advantages and limitations of both.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: A Protein-Protein Interaction network, what we call a PPI network is considered as an important source of information for prediction of protein functions. However, it is quite difficult to analyze such networks for their complexity. We expected that if we could develop a good visualizing method for PPI networks, we could predict protein functions visually because of the close relation between protein functions and protein interactions. Previously, we proposed one, which is based on clustering concepts, by extracting clusters defined as relatively densely connected group of nodes. But the results of visualization of a network differ very much depending on the clustering algorithm. Therefore, in this paper, we compare the outcome of two different clustering algorithms, namely DPClus and Newman algorithms, by applying them to a PPI network, and point out some advantages and limitations of both.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA12177013
• 書誌情報: IPSJ Transactions on Bioinformatics （TBIO）; 巻 47, 号 SIG17(TBIO1), p. 31-41, 発行日 2006-11-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-6679
• 出版者 / 言語: ja
• 出版者: 情報処理学会