View source: R/computeDriverDistance.R
computeDriverDistance | R Documentation |
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.
computeDriverDistance(geneSet, graph)
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. |
a list consisting of a mean distance of genes within the largest component to each other and the paiwise list of distances.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.