Description Usage Arguments Value Examples
A simulated annealing algorithm to find the highest scoring subnetwork within a graph.
1 | searchSubnet(pathway, scores, iterations = 1000, background)
|
pathway |
A gene network, or a list of gene networks,
in the |
scores |
A data frame with two columns: gene identifiers list (IDs have to be the same as for the pathways, e.g. Entrez) and associated scores. |
iterations |
Number of iterations. |
background |
For development purposes. |
A signet
object or a list of signet
objects. Each
signet
object consists in a table with gene IDs, their state,
their score; the subnetwork score and size and the p-value.
1 2 3 4 5 6 7 8 9 10 | # Get KEGG pathways from the package graphite:
# library(graphite)
# kegg <- pathways("hsapiens", "kegg")
# kegg_human <- lapply(kegg, pathwayGraph)
data(daub13) # load the example gene scores
#run the search in all the pathways with 2500 iterations (default)
example <- searchSubnet(kegg_human, scores)
summary(example)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.