Evidence map›Paper›PMID 29745859›Full record

ArticleBMC systems biology2018

Detecting complexes from edge-weighted PPI networks via genes expression analysis.

Zehua Zhang, Jian Song, Jijun Tang, Xinying Xu, Fei Guo

Abstract read
In one paragraph

Article in BMC systems biology, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing 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

4 citing papers in PubMed.

  1. Computational Analysis of Virus-Host Interactomes.Methods in molecular biology (Clifton, N.J.) · 2025
    Review
  2. PredAmyl-MLP: Prediction of Amyloid Proteins Using Multilayer Perceptron.Computational and mathematical methods in medicine · 2020
    Article
  3. Article
  4. 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.

Zehua ZhangSchool of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China.
Jian SongSchool of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China.
Jijun TangSchool of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China.
Xinying XuSchool of Information Engineering, Taiyuan University of Technology, Taiyuan, People's Republic of China.
Fei GuoSchool of Computer Science and Technology, Tianjin University, Tianjin, People's Republic of China. fguo@tju.edu.cn.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundIdentifying complexes from PPI networks has become a key problem to elucidate protein functions and identify signal and biological processes in a cell. Proteins binding as complexes are important roles of life activity. Accurate determination of complexes in PPI networks is crucial for understanding principles of cellular organization.

resultsWe propose a novel method to identify complexes on PPI networks, based on different co-expression information. First, we use Markov Cluster Algorithm with an edge-weighting scheme to calculate complexes on PPI networks. Then, we propose some significant features, such as graph information and gene expression analysis, to filter and modify complexes predicted by Markov Cluster Algorithm. To evaluate our method, we test on two experimental yeast PPI networks.

conclusionsOn DIP network, our method has Precision and F-Measure values of 0.6004 and 0.5528. On MIPS network, our method has F-Measure and S

Indexed as

Gene Expression ProfilingProtein Interaction MappingComplex detectionEdge-weighting schemeGene expression analysisGraph informationPPI networks

Identifiers

PMID29745859
PMCPMC5998908

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.