Evidence map›Paper›PMID 31234779›Full record

ArticleBMC bioinformatics2019

An iteration method for identifying yeast essential proteins from heterogeneous network.

Bihai Zhao, Yulin Zhao, Xiaoxia Zhang, Zhihong Zhang, Fan Zhang, Lei Wang

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
2.5field-weighted citation impact, top 10% 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

13 citing papers in PubMed, 42 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Review
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. An Effective Graph Clustering Method to Identify Cancer Driver Modules.Frontiers in bioengineering and biotechnology · 2020
    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

6 authors at 1 institution in 1 country.

Bihai ZhaoCollege of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410022, People's Republic of China.
Yulin ZhaoCollege of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410022, People's Republic of China.
Xiaoxia ZhangCollege of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410022, People's Republic of China.
Zhihong ZhangCollege of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410022, People's Republic of China.
Fan ZhangCollege of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410022, People's Republic of China.
Lei WangCollege of Computer Engineering and Applied Mathematics, Changsha University, Changsha, Hunan, 410022, People's Republic of China. wanglei@xtu.edu.cn.ORCID http://orcid.org/0000-0002-5065-8447
Hunan University · CN

Funding

National Natural Science Foundation of China 61672447National Natural Science Foundation of China 61772089National Natural Science Foundation of China 61873221
6 · The paper itself

Abstract

backgroundEssential proteins are distinctly important for an organism's survival and development and crucial to disease analysis and drug design as well. Large-scale protein-protein interaction (PPI) data sets exist in Saccharomyces cerevisiae, which provides us with a valuable opportunity to predict identify essential proteins from PPI networks. Many network topology-based computational methods have been designed to detect essential proteins. However, these methods are limited by the completeness of available PPI data. To break out of these restraints, some computational methods have been proposed by integrating PPI networks and multi-source biological data. Despite the progress in the research of multiple data fusion, it is still challenging to improve the prediction accuracy of the computational methods.

resultsIn this paper, we design a novel iterative model for essential proteins prediction, named Randomly Walking in the Heterogeneous Network (RWHN). In RWHN, a weighted protein-protein interaction network and a domain-domain association network are constructed according to the original PPI network and the known protein-domain association network, firstly. And then, we establish a new heterogeneous matrix by combining the two constructed networks with the protein-domain association network. Based on the heterogeneous matrix, a transition probability matrix is established by normalized operation. Finally, an improved PageRank algorithm is adopted on the heterogeneous network for essential proteins prediction. In order to eliminate the influence of the false negative, information on orthologous proteins and the subcellular localization information of proteins are integrated to initialize the score vector of proteins. In RWHN, the topology, conservative and functional features of essential proteins are all taken into account in the prediction process. The experimental results show that RWHN obviously exceeds in predicting essential proteins ten other competing methods.

conclusionsWe demonstrated that integrating multi-source data into a heterogeneous network can preserve the complex relationship among multiple biological data and improve the prediction accuracy of essential proteins. RWHN, our proposed method, is effective for the prediction of essential proteins.

Indexed as

AlgorithmsProtein DomainsProtein Interaction MappingProtein Interaction MapsSaccharomyces cerevisiaeSaccharomyces cerevisiae ProteinsSaccharomyces cerevisiae ProteinsEssential proteinsHeterogeneous networkProtein-protein interaction

Identifiers

PMID31234779
PMCPMC6591974
OpenAlexW2952874336

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.