prioritze.by.randomwalk: —————— Candidate prioritization by random walk...

In matthiasheinig/QTLnetwork: Basic package to apply random walks for QTL candidate gene priorization

Description

—————————————————————————– Candidate prioritization by random walk analysis

Usage

prioritze.by.randomwalk(locus.graph, largest.cc, string.nodes, tf.nodes,
  n.eigs = 500, mode = "propagation", return.g = FALSE)

Arguments

locus.graph	graphNEL object as generated in network_preprocess.R
largest.cc	graphNEL object with the largest connected component of the protein - protein interaction network
string.nodes	character vector with the names of the nodes in the PPI network
tf.nodes	character vector with the names of the transcription factors
n.eigs	number of eigen vectors to use for the approximation
mode	character "propagation" or "hitting.time"
return.g	logical should the graph used for analysis be returned?

Value

list with sentinel, cpgs, tfs, trans.genes, prop, best.trans.gene, best.tf, g

Author(s)

Matthias Heinig <[e-mail]>

—————————————————————————–

matthiasheinig/QTLnetwork documentation built on June 29, 2021, 10:11 p.m.