MinNetRank-package: MinNetRank

Description Details Author(s) Examples

Description

Discovery of candidate cancer genes by network-based integration of multi-omics data

Details

MinNetRank utilized minimum strategy to prioritize genes both the mutation relevance score and expression relevance score are high. MinNetRank was a single sample network diffusion approach that could detect personalized driver genes. MinNetRank combined the ranking of genes for individual samples into a robust population-level gene ranking.

Author(s)

Ting Wei <weitinging@sjtu.edu.cn>; Zhangsheng Yu Maintainer: Ting Wei <weitinging@sjtu.edu.cn>

Examples

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
library(MinNetRank)

#load the adjacency network
data("AdjacencyMatrix")

#load the known cancer genes
data("KnownGenes")

#load the mutation data
data("LihcMutation")

#load the tumor expression data
data("LihcTumorExpression")

#load the normal expression data
data("LihcNormalExpression")

#Using AdjacencyMatrix

##Using the mutation and expression data
Network = "AdjacencyMatrix"
LihcMinNetRank = MinNetRank(Network, SNP=LihcMutation, TumorExpression=LihcTumorExpression, NormalExpression=LihcNormalExpression, CGC=KnownGenes, beta = 0.4841825)
write.table(LihcMinNetRank, file='TCGA-LIHC.MinNetRank.Result.xls', quote =F, sep="\t", row.names = FALSE)

##Using the mutation data
Network = "AdjacencyMatrix"
LihcMinNetRankMutation = MinNetRank(Network, SNP=LihcMutation, CGC=KnownGenes, beta = 0.4841825)
write.table(LihcMinNetRankMutation, file='TCGA-LIHC.MinNetRank.Mutation.xls', quote =F, sep="\t", row.names = FALSE)

##Using the expression data
Network = "AdjacencyMatrix"
LihcMinNetRankExp = MinNetRank(Network, TumorExpression=LihcTumorExpression, NormalExpression=LihcNormalExpression, CGC=KnownGenes, beta = 0.4841825)
write.table(LihcMinNetRankExp, file='TCGA-LIHC.MinNetRank.Expression.xls', quote =F, sep="\t", row.names = FALSE)

weitinging/MinNetRank documentation built on Dec. 29, 2019, 12:26 a.m.