ArticleBMC bioinformatics2015
A density-based clustering approach for identifying overlapping protein complexes with functional preferences.
Article in BMC bioinformatics, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
13 citing papers in PubMed.
- Identifying novel therapeutic targets of natural compounds in traditional Chinese medicine herbs with hypergraph representation learning.Briefings in bioinformatics · 2025Article
- A multi-objective evolutionary algorithm for detecting protein complexes in PPI networks using gene ontology.Scientific reports · 2025Article
- An Ensemble Learning Framework for Detecting Protein Complexes From PPI Networks.Frontiers in genetics · 2022Article
- CDAP: An Online Package for Evaluation of Complex Detection Methods.Scientific reports · 2019Article
- Building the drug-GO function network to screen significant candidate drugs for myasthenia gravis.PloS one · 2019Article
- Detection of Protein Complexes Based on Penalized Matrix Decomposition in a Sparse Protein⁻Protein Interaction Network.Molecules (Basel, Switzerland) · 2018Article
- MTGO: PPI Network Analysis Via Topological and Functional Module Identification.Scientific reports · 2018Article
- From protein-protein interactions to protein co-expression networks: a new perspective to evaluate large-scale proteomic data.EURASIP journal on bioinformatics & systems biology · 2017Review
- Discovering overlapped protein complexes from weighted PPI networks by removing inter-module hubs.Scientific reports · 2017Article
- Article
- A density-based approach for detecting complexes in weighted PPI networks by semantic similarity.PloS one · 2017Article
- Using contrast patterns between true complexes and random subgraphs in PPI networks to predict unknown protein complexes.Scientific reports · 2016Article
- From communities to protein complexes: A local community detection algorithm on PPI networks.PloS oneArticle
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundIdentifying 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.
resultsTo 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.
conclusionsAccording 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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.