Evidence map›Paper›PMID 28130237›Full record

ArticleBioinformatics (Oxford, England)2017

Identification of protein complexes by integrating multiple alignment of protein interaction networks.

Cheng-Yu Ma, Yi-Ping Phoebe Chen, Bonnie Berger, Chung-Shou Liao

Open access · bronzeAbstract read
In one paragraph

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.

0numbers the graph read from it
0cells of the map it votes in
16citing papers in PubMed
6.7field-weighted citation impact, top 2% of its field
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

16 citing papers in PubMed, 85 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. 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 · 2019
    Article
  13. Article
  14. Article
  15. Article
  16. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors at 3 institutions in 3 countries.

Cheng-Yu MaDepartment of Computer Science, National Tsing Hua University, Hsinchu, Taiwan.
Yi-Ping Phoebe ChenDepartment of Computer Science and Computer Engineering, La Trobe University, Melbourne, Vic, Australia.
Bonnie BergerComputer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA.
Chung-Shou LiaoDepartment of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan.
La Trobe University · AUMassachusetts Institute of Technology · USNational Tsing Hua University · TW

Funding

Structure-Based Prediction of the InteractomeR01GM081871 · NIGMS · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI BERGER, BONNIE · 2008 to 2020
$4.3M
NIGMS NIH HHS R01 GM081871
6 · The paper itself

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

AlgorithmsProtein Interaction MapsAnimalsCluster AnalysisComputational BiologyDrosophila melanogasterHumansMultiprotein ComplexesProtein MultimerizationSaccharomyces cerevisiaeMultiprotein Complexes

Identifiers

PMID28130237
PMCPMC5860626
OpenAlexW2581439210

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

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.