computeDriverDistance: Compute Graph Distance

View source: R/computeDriverDistance.R

computeDriverDistanceR Documentation

Compute Graph Distance

Description

Finds the finds the maximal (weakly or strongly) connected component of 'graph' then returns the distances between members in 'geneSet' which are found in the largest component.

Usage

computeDriverDistance(geneSet, graph)

Arguments

geneSet

Required. A user specified gene set corresponding to vertex names in 'graph'. All the names are not required to be entirely represented in the graph object.

graph

Required. An igraph graph object consisting of vertices of genes and edges representing co-expression between genes.

Value

a list consisting of a mean distance of genes within the largest component to each other and the paiwise list of distances.


Sage-Bionetworks/metanetwork documentation built on April 27, 2022, 7:42 a.m.