Evidence map›Paper›PMID 30134824›Full record

ArticleBMC bioinformatics2018

Predicting overlapping protein complexes based on core-attachment and a local modularity structure.

Rongquan Wang, Guixia Liu, Caixia Wang, Lingtao Su, Liyan Sun

Abstract read
In one paragraph

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.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
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

9 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. 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

5 authors.

Rongquan WangCollege of Computer Science and Technology, Jilin University, No. 2699 Qianjin Street, Changchun, 130012, China.
Guixia LiuCollege of Computer Science and Technology, Jilin University, No. 2699 Qianjin Street, Changchun, 130012, China. liugx@jlu.edu.cn.
Caixia WangSchool of International Economics, China Foreign Affairs University, 24 Zhanlanguan Road, Xicheng District, Beijing, 100037, China.
Lingtao SuCollege of Computer Science and Technology, Jilin University, No. 2699 Qianjin Street, Changchun, 130012, China.
Liyan SunCollege of Computer Science and Technology, Jilin University, No. 2699 Qianjin Street, Changchun, 130012, China.

Funding

National Nature Science Foundation of China 61373051National Nature Science Foundation of China 61772226Science and Technology Development Program of Jilin Province 20140204004GX
6 · The paper itself

Abstract

backgroundIn recent decades, detecting protein complexes (PCs) from protein-protein interaction networks (PPINs) has been an active area of research. There are a large number of excellent graph clustering methods that work very well for identifying PCs. However, most of existing methods usually overlook the inherent core-attachment organization of PCs. Therefore, these methods have three major limitations we should concern. Firstly, many methods have ignored the importance of selecting seed, especially without considering the impact of overlapping nodes as seed nodes. Thus, there may be false predictions. Secondly, PCs are generally supposed to be dense subgraphs. However, the subgraphs with high local modularity structure usually correspond to PCs. Thirdly, a number of available methods lack handling noise mechanism, and miss some peripheral proteins. In summary, all these challenging issues are very important for predicting more biological overlapping PCs.

resultsIn this paper, to overcome these weaknesses, we propose a clustering method by core-attachment and local modularity structure, named CALM, to detect overlapping PCs from weighted PPINs with noises. Firstly, we identify overlapping nodes and seed nodes. Secondly, for a node, we calculate the support function between a node and a cluster. In CALM, a cluster which initially consists of only a seed node, is extended by adding its direct neighboring nodes recursively according to the support function, until this cluster forms a locally optimal modularity subgraph. Thirdly, we repeat this process for the remaining seed nodes. Finally, merging and removing procedures are carried out to obtain final predicted clusters. The experimental results show that CALM outperforms other classical methods, and achieves ideal overall performance. Furthermore, CALM can match more complexes with a higher accuracy and provide a better one-to-one mapping with reference complexes in all test datasets. Additionally, CALM is robust against the high rate of noise PPIN.

conclusionsBy considering core-attachment and local modularity structure, CALM could detect PCs much more effectively than some representative methods. In short, CALM could potentially identify previous undiscovered overlapping PCs with various density and high modularity.

Indexed as

AlgorithmsCluster AnalysisDatabases, ProteinProtein Interaction MappingProtein Interaction MapsProteinsProteinsCore-attachment and local modularity structureNode betweennessOverlapping nodeProtein complexProtein-protein interaction networksSeed-extension paradigm

Identifiers

PMID30134824
PMCPMC6106838

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.