ArticleBMC bioinformatics2018
Protein complexes identification based on go attributed network embedding.
Article in BMC bioinformatics, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 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
9 citing papers in PubMed.
- PCIPG: A comprehensive framework for protein complex identification based on a probabilistic graphical model.PLoS computational biology · 2026Article
- PCIPG2.0: multi-omics fusion and structure-aware graph autoencoding for protein complex identification.Bioinformatics (Oxford, England) · 2026Article
- Multi-source biological knowledge-guided hypergraph spatiotemporal subnetwork embedding for protein complex identification.Briefings in bioinformatics · 2024Article
- Spatiotemporal constrained RNA-protein heterogeneous network for protein complex identification.Briefings in bioinformatics · 2024Article
- Small protein complex prediction algorithm based on protein-protein interaction network segmentation.BMC bioinformatics · 2022Article
- A supervised protein complex prediction method with network representation learning and gene ontology knowledge.BMC bioinformatics · 2022Article
- Computational identification of protein complexes from network interactions: Present state, challenges, and the way forward.Computational and structural biotechnology journal · 2022Review
- Detecting overlapping protein complexes in weighted PPI network based on overlay network chain in quotient space.BMC bioinformatics · 2019Article
- Integrating data and knowledge to identify functional modules of genes: a multilayer approach.BMC bioinformatics · 2019Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
Abstract
backgroundIdentifying protein complexes from protein-protein interaction (PPI) network is one of the most important tasks in proteomics. Existing computational methods try to incorporate a variety of biological evidences to enhance the quality of predicted complexes. However, it is still a challenge to integrate different types of biological information into the complexes discovery process under a unified framework. Recently, attributed network embedding methods have be proved to be remarkably effective in generating vector representations for nodes in the network. In the transformed vector space, both the topological proximity and node attributed affinity between different nodes are preserved. Therefore, such attributed network embedding methods provide us a unified framework to integrate various biological evidences into the protein complexes identification process.
resultsIn this article, we propose a new method called GANE to predict protein complexes based on Gene Ontology (GO) attributed network embedding. Firstly, it learns the vector representation for each protein from a GO attributed PPI network. Based on the pair-wise vector representation similarity, a weighted adjacency matrix is constructed. Secondly, it uses the clique mining method to generate candidate cores. Consequently, seed cores are obtained by ranking candidate cores based on their densities on the weighted adjacency matrix and removing redundant cores. For each seed core, its attachments are the proteins with correlation score that is larger than a given threshold. The combination of a seed core and its attachment proteins is reported as a predicted protein complex by the GANE algorithm. For performance evaluation, we compared GANE with six protein complex identification methods on five yeast PPI networks. Experimental results showes that GANE performs better than the competing algorithms in terms of different evaluation metrics.
conclusionsGANE provides a framework that integrate many valuable and different biological information into the task of protein complex identification. The protein vector representation learned from our attributed PPI network can also be used in other tasks, such as PPI prediction and disease gene prediction.
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.