Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23682
Title: A density-based clustering approach for identifying overlapping protein complexes with functional preferences
Authors: Hu, L
Chan, KCC 
Issue Date: 2015
Publisher: BioMed Central
Source: BMC bioinformatics, 2015, v. 16, 174, p. 1-16 How to cite?
Journal: BMC bioinformatics 
Abstract: Background: Identifying protein complexes is an essential task for understanding the mechanisms of proteins in cells. Many computational approaches have thus been developed to identify protein complexes in protein-protein interaction (PPI) networks. Regarding the information that can be adopted by computational approaches to identify protein complexes, in addition to the graph topology of PPI network, the consideration of functional information of proteins has been becoming popular recently. Relevant approaches perform their tasks by relying on the idea that proteins in the same protein complex may be associated with similar functional information. However, we note from our previous researches that for most protein complexes their proteins are only similar in specific subsets of categories of functional information instead of the entire set. Hence, if the preference of each functional category can also be taken into account when identifying protein complexes, the accuracy will be improved. Results: To implement the idea, we first introduce a preference vector for each of proteins to quantitatively indicate the preference of each functional category when deciding the protein complex this protein belongs to. Integrating functional preferences of proteins and the graph topology of PPI network, we formulate the problem of identifying protein complexes into a constrained optimization problem, and we propose the approach DCAFP to address it. For performance evaluation, we have conducted extensive experiments with several PPI networks from the species of Saccharomyces cerevisiae and Human and also compared DCAFP with state-of-the-art approaches in the identification of protein complexes. The experimental results show that considering the integration of functional preferences and dense structures improved the performance of identifying protein complexes, as DCAFP outperformed the other approaches for most of PPI networks based on the assessments of independent measures of f-measure, Accuracy and Maximum Matching Rate. Furthermore, the function enrichment experiments indicated that DCAFP identified more protein complexes with functional significance when compared with approaches, such as PCIA, that also utilize the functional information. Conclusions: According to the promising performance of DCAFP, the integration of functional preferences and dense structures has made it possible to identify protein complexes more accurately and significantly. ? 2015 Hu and Chan; licensee BioMed Central.
URI: http://hdl.handle.net/10397/23682
EISSN: 1471-2105
DOI: 10.1186/s12859-015-0583-3
Rights: © 2015 Hu and Chan; licensee BioMed Central. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. The Creative Commons Public DomainDedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article,unless otherwise stated.
The following publication Hu, L., & Chan, K. C. C. (2015). A density-based clustering approach for identifying overlapping protein complexes with functional preferences. BMC Bioinformatics, 16, 174, 1-16 is available at https://dx.doi.org/10.1186/s12859-015-0583-3
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Hu_Density-Based_Clustering_Identifying.pdf1.91 MBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Apr 4, 2019

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Apr 5, 2019

Page view(s)

101
Last Week
3
Last month
Citations as of Oct 22, 2019

Download(s)

5
Citations as of Oct 22, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.