... | ... |
@@ -29,25 +29,25 @@ edges on a metabolic network). |
29 | 29 |
# Calculate Pearson's correlation. |
30 | 30 |
data(ex_microarray) # Part of ALL dataset. |
31 | 31 |
rgraph <- assignEdgeWeights(microarray = ex_microarray, graph = rgraph, |
32 |
- weight.method = "cor", use.attr="miriam.uniprot", |
|
32 |
+ weight.method = "cor", use.attr="miriam.uniprot", |
|
33 | 33 |
y=factor(colnames(ex_microarray)), bootstrap = FALSE) |
34 | 34 |
|
35 | 35 |
## Get ranked paths using probabilistic shortest paths. |
36 |
- ranked.p <- pathRanker(rgraph, method="prob.shortest.path", |
|
36 |
+ ranked.p <- pathRanker(rgraph, method="prob.shortest.path", |
|
37 | 37 |
K=20, minPathSize=6) |
38 |
- |
|
38 |
+ |
|
39 | 39 |
## Get the edge ids along paths in the reaction graph. |
40 | 40 |
path.eids <- getPathsAsEIDs(ranked.p, rgraph) |
41 | 41 |
|
42 | 42 |
## Get the edge ids along paths in the original metabolic graph. |
43 | 43 |
path.eids <- getPathsAsEIDs(ranked.p, ex_sbml) |
44 | 44 |
|
45 |
-} |
|
46 |
-\author{ |
|
47 |
-Ahmed Mohamed |
|
48 | 45 |
} |
49 | 46 |
\seealso{ |
50 | 47 |
Other Path ranking methods: \code{\link{extractPathNetwork}}, |
51 | 48 |
\code{\link{pathRanker}}, \code{\link{samplePaths}} |
52 | 49 |
} |
53 |
- |
|
50 |
+\author{ |
|
51 |
+Ahmed Mohamed |
|
52 |
+} |
|
53 |
+\concept{Path ranking methods} |
... | ... |
@@ -1,4 +1,5 @@ |
1 |
-% Generated by roxygen2 (4.0.1): do not edit by hand |
|
1 |
+% Generated by roxygen2: do not edit by hand |
|
2 |
+% Please edit documentation in R/pathRank.R |
|
2 | 3 |
\name{getPathsAsEIDs} |
3 | 4 |
\alias{getPathsAsEIDs} |
4 | 5 |
\title{Convert a ranked path list to edge ids of a graph} |
... | ... |
@@ -19,7 +20,7 @@ a different representation (for example matching path from a reaction network to |
19 | 20 |
edges on a metabolic network). |
20 | 21 |
} |
21 | 22 |
\examples{ |
22 |
-## Prepare a weighted reaction network. |
|
23 |
+ ## Prepare a weighted reaction network. |
|
23 | 24 |
## Conver a metabolic network to a reaction network. |
24 | 25 |
data(ex_sbml) # bipartite metabolic network of Carbohydrate metabolism. |
25 | 26 |
rgraph <- makeReactionNetwork(ex_sbml, simplify=TRUE) |
... | ... |
@@ -28,24 +29,25 @@ edges on a metabolic network). |
28 | 29 |
# Calculate Pearson's correlation. |
29 | 30 |
data(ex_microarray) # Part of ALL dataset. |
30 | 31 |
rgraph <- assignEdgeWeights(microarray = ex_microarray, graph = rgraph, |
31 |
- weight.method = "cor", use.attr="miriam.uniprot", |
|
32 |
+ weight.method = "cor", use.attr="miriam.uniprot", |
|
32 | 33 |
y=factor(colnames(ex_microarray)), bootstrap = FALSE) |
33 | 34 |
|
34 | 35 |
## Get ranked paths using probabilistic shortest paths. |
35 |
- ranked.p <- pathRanker(rgraph, method="prob.shortest.path", |
|
36 |
+ ranked.p <- pathRanker(rgraph, method="prob.shortest.path", |
|
36 | 37 |
K=20, minPathSize=6) |
37 |
- |
|
38 |
+ |
|
38 | 39 |
## Get the edge ids along paths in the reaction graph. |
39 | 40 |
path.eids <- getPathsAsEIDs(ranked.p, rgraph) |
40 | 41 |
|
41 | 42 |
## Get the edge ids along paths in the original metabolic graph. |
42 | 43 |
path.eids <- getPathsAsEIDs(ranked.p, ex_sbml) |
44 |
+ |
|
43 | 45 |
} |
44 | 46 |
\author{ |
45 | 47 |
Ahmed Mohamed |
46 | 48 |
} |
47 | 49 |
\seealso{ |
48 |
-Other Path ranking methods: \code{\link{extractPathNetwork}}; |
|
49 |
- \code{\link{pathRanker}}; \code{\link{samplePaths}} |
|
50 |
+Other Path ranking methods: \code{\link{extractPathNetwork}}, |
|
51 |
+ \code{\link{pathRanker}}, \code{\link{samplePaths}} |
|
50 | 52 |
} |
51 | 53 |
|
added plotCytoscapeGML , Geneset export formats, bug fixes
... | ... |
@@ -1,3 +1,4 @@ |
1 |
+% Generated by roxygen2 (4.0.1): do not edit by hand |
|
1 | 2 |
\name{getPathsAsEIDs} |
2 | 3 |
\alias{getPathsAsEIDs} |
3 | 4 |
\title{Convert a ranked path list to edge ids of a graph} |
... | ... |
@@ -5,19 +6,17 @@ |
5 | 6 |
getPathsAsEIDs(paths, graph) |
6 | 7 |
} |
7 | 8 |
\arguments{ |
8 |
- \item{paths}{The paths extracted by |
|
9 |
- \code{\link{pathRanker}}.} |
|
9 |
+\item{paths}{The paths extracted by \code{\link{pathRanker}}.} |
|
10 | 10 |
|
11 |
- \item{graph}{A annotated igraph object.} |
|
11 |
+\item{graph}{A annotated igraph object.} |
|
12 | 12 |
} |
13 | 13 |
\value{ |
14 | 14 |
A list of edge ids on the provided graph. |
15 | 15 |
} |
16 | 16 |
\description{ |
17 |
-Convert a ranked path list to Edge ids of a graph, where |
|
18 |
-paths can come from a different representation (for example |
|
19 |
-matching path from a reaction network to edges on a |
|
20 |
-metabolic network). |
|
17 |
+Convert a ranked path list to Edge ids of a graph, where paths can come from |
|
18 |
+a different representation (for example matching path from a reaction network to |
|
19 |
+edges on a metabolic network). |
|
21 | 20 |
} |
22 | 21 |
\examples{ |
23 | 22 |
## Prepare a weighted reaction network. |
... | ... |
@@ -46,8 +45,7 @@ metabolic network). |
46 | 45 |
Ahmed Mohamed |
47 | 46 |
} |
48 | 47 |
\seealso{ |
49 |
-Other Path ranking methods: |
|
50 |
-\code{\link{extractPathNetwork}}; \code{\link{pathRanker}}; |
|
51 |
-\code{\link{samplePaths}} |
|
48 |
+Other Path ranking methods: \code{\link{extractPathNetwork}}; |
|
49 |
+ \code{\link{pathRanker}}; \code{\link{samplePaths}} |
|
52 | 50 |
} |
53 | 51 |
|
1 | 1 |
new file mode 100644 |
... | ... |
@@ -0,0 +1,53 @@ |
1 |
+\name{getPathsAsEIDs} |
|
2 |
+\alias{getPathsAsEIDs} |
|
3 |
+\title{Convert a ranked path list to edge ids of a graph} |
|
4 |
+\usage{ |
|
5 |
+getPathsAsEIDs(paths, graph) |
|
6 |
+} |
|
7 |
+\arguments{ |
|
8 |
+ \item{paths}{The paths extracted by |
|
9 |
+ \code{\link{pathRanker}}.} |
|
10 |
+ |
|
11 |
+ \item{graph}{A annotated igraph object.} |
|
12 |
+} |
|
13 |
+\value{ |
|
14 |
+A list of edge ids on the provided graph. |
|
15 |
+} |
|
16 |
+\description{ |
|
17 |
+Convert a ranked path list to Edge ids of a graph, where |
|
18 |
+paths can come from a different representation (for example |
|
19 |
+matching path from a reaction network to edges on a |
|
20 |
+metabolic network). |
|
21 |
+} |
|
22 |
+\examples{ |
|
23 |
+## Prepare a weighted reaction network. |
|
24 |
+ ## Conver a metabolic network to a reaction network. |
|
25 |
+ data(ex_sbml) # bipartite metabolic network of Carbohydrate metabolism. |
|
26 |
+ rgraph <- makeReactionNetwork(ex_sbml, simplify=TRUE) |
|
27 |
+ |
|
28 |
+ ## Assign edge weights based on Affymetrix attributes and microarray dataset. |
|
29 |
+ # Calculate Pearson's correlation. |
|
30 |
+ data(ex_microarray) # Part of ALL dataset. |
|
31 |
+ rgraph <- assignEdgeWeights(microarray = ex_microarray, graph = rgraph, |
|
32 |
+ weight.method = "cor", use.attr="miriam.uniprot", |
|
33 |
+ y=factor(colnames(ex_microarray)), bootstrap = FALSE) |
|
34 |
+ |
|
35 |
+ ## Get ranked paths using probabilistic shortest paths. |
|
36 |
+ ranked.p <- pathRanker(rgraph, method="prob.shortest.path", |
|
37 |
+ K=20, minPathSize=6) |
|
38 |
+ |
|
39 |
+ ## Get the edge ids along paths in the reaction graph. |
|
40 |
+ path.eids <- getPathsAsEIDs(ranked.p, rgraph) |
|
41 |
+ |
|
42 |
+ ## Get the edge ids along paths in the original metabolic graph. |
|
43 |
+ path.eids <- getPathsAsEIDs(ranked.p, ex_sbml) |
|
44 |
+} |
|
45 |
+\author{ |
|
46 |
+Ahmed Mohamed |
|
47 |
+} |
|
48 |
+\seealso{ |
|
49 |
+Other Path ranking methods: |
|
50 |
+\code{\link{extractPathNetwork}}; \code{\link{pathRanker}}; |
|
51 |
+\code{\link{samplePaths}} |
|
52 |
+} |
|
53 |
+ |