ArticleBioinformatics (Oxford, England)2017
Identification of protein complexes by integrating multiple alignment of protein interaction networks.
Article in Bioinformatics (Oxford, England), 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 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
16 citing papers in PubMed, 85 citations in OpenAlex.
- Improved protein interaction models predict differences in complexes between human cell lines.bioRxiv : the preprint server for biology · 2024Article
- Integration of protein sequence and protein-protein interaction data by hypergraph learning to identify novel protein complexes.Briefings in bioinformatics · 2024Article
- DIAMIN: a software library for the distributed analysis of large-scale molecular interaction networks.BMC bioinformatics · 2022Article
- Detecting protein complexes with multiple properties by an adaptive harmony search algorithm.BMC bioinformatics · 2022Article
- An Ensemble Learning Framework for Detecting Protein Complexes From PPI Networks.Frontiers in genetics · 2022Article
- Classification in biological networks with hypergraphlet kernels.Bioinformatics (Oxford, England) · 2021Article
- An Improved Memetic Algorithm for Detecting Protein Complexes in Protein Interaction Networks.Frontiers in genetics · 2021Article
- iMPTCE-Hnetwork: A Multilabel Classifier for Identifying Metabolic Pathway Types of Chemicals and Enzymes with a Heterogeneous Network.Computational and mathematical methods in medicine · 2021Article
- KSP: an integrated method for predicting catalyzing kinases of phosphorylation sites in proteins.BMC genomics · 2020Article
- A review of protein-protein interaction network alignment: From pathway comparison to global alignment.Computational and structural biotechnology journal · 2020Review
- Identifying protein complexes based on an edge weight algorithm and core-attachment structure.BMC bioinformatics · 2019Article
- Integration of Heterogeneous Experimental Data Improves Global Map of Human Protein Complexes.ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine · 2019Article
- A seed-extended algorithm for detecting protein complexes based on density and modularity with topological structure and GO annotations.BMC genomics · 2019Article
- Integrating data and knowledge to identify functional modules of genes: a multilayer approach.BMC bioinformatics · 2019Article
- Protein complex detection based on flower pollination mechanism in multi-relation reconstructed dynamic protein networks.BMC bioinformatics · 2019Article
- Predicting overlapping protein complexes based on core-attachment and a local modularity structure.BMC bioinformatics · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors at 3 institutions in 3 countries.
Funding
Abstract
motivationProtein complexes are one of the keys to studying the behavior of a cell system. Many biological functions are carried out by protein complexes. During the past decade, the main strategy used to identify protein complexes from high-throughput network data has been to extract near-cliques or highly dense subgraphs from a single protein-protein interaction (PPI) network. Although experimental PPI data have increased significantly over recent years, most PPI networks still have many false positive interactions and false negative edge loss due to the limitations of high-throughput experiments. In particular, the false negative errors restrict the search space of such conventional protein complex identification approaches. Thus, it has become one of the most challenging tasks in systems biology to automatically identify protein complexes.
resultsIn this study, we propose a new algorithm, NEOComplex ( NE CC- and O rtholog-based Complex identification by multiple network alignment), which integrates functional orthology information that can be obtained from different types of multiple network alignment (MNA) approaches to expand the search space of protein complex detection. As part of our approach, we also define a new edge clustering coefficient (NECC) to assign weights to interaction edges in PPI networks so that protein complexes can be identified more accurately. The NECC is based on the intuition that there is functional information captured in the common neighbors of the common neighbors as well. Our results show that our algorithm outperforms well-known protein complex identification tools in a balance between precision and recall on three eukaryotic species: human, yeast, and fly. As a result of MNAs of the species, the proposed approach can tolerate edge loss in PPI networks and even discover sparse protein complexes which have traditionally been a challenge to predict. AVAILABILITY AND IMPLEMENTATION: http://acolab.ie.nthu.edu.tw/bionetwork/NEOComplex. CONTACT: bab@csail.mit.edu or csliao@ie.nthu.edu.tw. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
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.