2012
DOI: 10.1007/978-3-642-30220-6_25
|View full text |Cite
|
Sign up to set email alerts
|

Prioritizing Disease Genes by Bi-Random Walk

Abstract: Abstract. Random walk methods have been successfully applied to prioritizing disease causal genes. In this paper, we propose a bi-random walk algorithm (BiRW) based on a regularization framework for graph matching to globally prioritize disease genes for all phenotypes simultaneously. While previous methods perform random walk either on the proteinprotein interaction network or the complete phenome-genome heterogenous network, BiRW performs random walk on the Kronecker product graph between the protein-protein… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
49
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 48 publications
(49 citation statements)
references
References 21 publications
0
49
0
Order By: Relevance
“…Our problem formulation generalizes the existing label propagation methods designed for using a single generic molecular network [12, 13] to NoN. Important symbols used in this paper are summarized in Table 1.…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…Our problem formulation generalizes the existing label propagation methods designed for using a single generic molecular network [12, 13] to NoN. Important symbols used in this paper are summarized in Table 1.…”
Section: Methodsmentioning
confidence: 99%
“…The first two criteria focus on ranking scores within individual molecular networks. They are commonly used in previous network prorogation methods [12, 13, 26]. The third criterion is specific to the NoN model.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations