-
Notifications
You must be signed in to change notification settings - Fork 3
/
README.Rmd
416 lines (317 loc) · 14.1 KB
/
README.Rmd
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
---
title: "Parsing OncoTree into a Tidygraph"
author: "Joshua Cook"
date: "3/16/2020"
output:
md_document:
variant: gfm
---
```{r setup, include=FALSE}
knitr::opts_chunk$set(echo = TRUE, comment = "#>")
```
## Introduction
Cancers are often first classified by their tissue of origin, but there are several types of cancer for each tissue.
Further, each of these can have several subdivisions.
For example, head and neck cancers can be further divided into seven cancers, including head and neck squamous cell carcinoma (HNSC).
HNSC itself has six subtypes, too.
This hierarchy can be represented in a directed acyclic graph (DAG), as shown below.
![](./assets/oncotree_online_example.png)
The [OncoTree](http://oncotree.mskcc.org/#/home) is a DAG of cancer subtypes maintained by one of the leading cancer research institutes, [Memorial Sloan Kettering](https://www.mskcc.org) (MSK).
For one of my projects in [lab](https://www.haigislab.org), I am dealing with many types of cancers from a variety of studies.
Thus, I want to use OncoTree to organize the types and provide relational information of the cancers.
For instance, depending on what I want to analyze, I may want the most specific subtype of cancer possible, or maybe I want the cancer grouped by their first level on the OncoTree (e.g. "Head and Neck").
Therefore, I decided to parse the OncoTree into a ['tidygraph'](https://cran.r-project.org/web/packages/tidygraph/index.html), a "tidy" way to manage graph structures.
The following is a tutorial on how I did this.
The GitHub repository for this analysis is available at [jhrcook/tidygraph-oncotree](https://github.com/jhrcook/tidygraph-oncotree).
## Setup
I will load the packages 'tidyverse', 'tidygraph', and 'ggraph', and also use 'httr' and 'jsonlite', but call functions directly from their namespace.
The 'ggraph' package is a "grammar of graphics" for graph structures - it is used for plotting graphs at the end of this tutorial.
```{r}
library(ggraph)
library(tidygraph)
library(tidyverse)
```
## Sending requests to OncoTree's API
The OncoTree has a fairly simple API (shown below).
We are interested in acquiring the full tree so we will use the "/api/tumorTypes/tree" endpoint.
![](./assets/oncotree-api.png)
We can use the package ['httr'](https://cran.r-project.org/web/packages/httr/index.html) to send a "get" request to the OncoTree API.
Checking the status code indicates how the request went, 200 representing success.
```{r}
oncotree_res <- httr::GET("http://oncotree.mskcc.org/api/tumorTypes/tree")
oncotree_res$status_code
```
The request returns a list of lists containing meta data on the request and the actual OncoTree data.
```{r}
httr::headers(oncotree_res)
```
The OncoTree data is a JSON in the `content` list of the response.
In case you want this data for other projects, the JSON can be written to file using the `write()` function.
```{r}
write(rawToChar(oncotree_res$content), file.path("oncotree.json"))
```
## Parsing the OncoTree JSON
The OncoTree is organized as a highly nested list.
To get insight into the structure we must turn the JSON into a list of lists so we can parse it in R.
```{r}
oncotree_json <- jsonlite::fromJSON(rawToChar(oncotree_res$content))
```
From here, I just played around with the list until I got an understanding of the structure.
```{r}
names(oncotree_json)
```
```{r}
names(oncotree_json$TISSUE)
```
```{r}
oncotree_json$TISSUE$code
```
```{r}
oncotree_json$TISSUE$name
```
```{r}
oncotree_json$TISSUE$level
```
Almost all of the parts of `oncotree_json$TISSUE` contain information about the first level of the graph.
The `children` section, though, contains all of the tissues that we can see on the OncoTree web application.
```{r}
names(oncotree_json$TISSUE$children)
```
Each of these children "nodes" had the same information, and children of their own, and so on.
```{r}
names(oncotree_json$TISSUE$children$HEAD_NECK)
```
```{r}
names(oncotree_json$TISSUE$children$HEAD_NECK$children)
```
Therefore, we can tell that the JSON is a nested list of the nodes in the DAG.
And all we need to do is implement a graph-traversing function to extract all of the information.
Since it is nested and we are building a graph, this strongly suggests we will need a recursive algorithm.
## Building the Tidygraph
### Data needed for the tidygraph
To figure out what to do first, I often find it helpful to figure out what my output should look like.
To make a `tidygraph`, I will need an *edge list* and a *node list*.
The first is a two-column table with names "from" and "to" populated by names of the nodes where each row indicates an edge of the graph.
The node list is optional and contains any other information about each node, one row per node.
Here is a mock example of the data frames we want out of our recursive algorithm.
```{r}
# edge list
edge_list <- tibble::tribble(
~ from, ~ to,
"A", "B",
"B", "C",
"C", "D",
"A", "D",
"B", "E",
"E", "D"
)
edge_list
```
```{r}
# node list
node_list <- tibble(name = LETTERS[1:5], values = round(runif(5), 2))
node_list
```
The edge list can be turned into a `tidygraph` object using the `as_tbl_graph()` function.
I explicitly set the `directed` parameter `TRUE` even though it is the default value.
```{r}
gr <- as_tbl_graph(edge_list, directed = TRUE)
gr
```
To add the node information, I join the node list table by the "name" column.
The `%N>%` infix operates just like the 'magrittr' pipe `%>%` except it also activates the nodes of the `tidygraph` object so that the `full_join()` operates on the nodes and not the edges.
I am not able to fully describe the 'tidygraph' API in this tutorial, but see vignettes by the creator, Thomas Pedersen ([\@thomasp85](https://twitter.com/thomasp85)), for a good introduction: [Data Imaginist - tidygraph](https://www.data-imaginist.com/tags/tidygraph).
```{r}
gr %N>%
full_join(node_list, by = "name")
```
Now we just need to figure out how to build an edge list and node list from the nested JSON.
### Extracting OncoTree from the JSON
> Note: Below I demonstrate how to create the final algorithm as if it was a linear process - it in fact took me about and hour and a half of toying with the functions to get the desired result. If it is not easy to grasp right away, don't worry, it wasn't for me either.
So we know our algorithm will be recursive, which means we will pass the first node to a function once and this function will call itself from within.
Therefore, let's create a function `add_children_to_dag()` that takes a node and an edge list and returns an edge list.
```{r}
add_children_to_dag <- function(node, el) {
return(el)
}
```
#### Extracting node information
First, we can deal with the node information becasue that can be extracted right away and stashed in a global variable, no recursion needed.
```{r}
# The node information.
NODE_INFO <- tibble()
# Build a tibble of the node information from Oncotree.
extract_node_info <- function(node) {
NODE_INFO <<- bind_rows(
NODE_INFO,
tibble(
code = node$code,
description = node$name,
tissue = ifelse(is.null(node$tissue), "tissue", node$tissue),
main_type = ifelse(is.null(node$mainType), "tissue", node$mainType),
color = ifelse(is.null(node$color), "Black", node$color),
level = node$level
)
)
}
add_children_to_dag <- function(node, el) {
# Add node information to the `NODE_INFO` global variable.
extract_node_info(node)
return(el)
}
```
Now, the node information is extracted and added to a global variable `NODE_INFO` using the `extract_node_info()` function.
It just pulls out some of the useful information from the JSON for each node and binds it with the existing data frame.
Now we can run the first experiment to make sure everything is working properly.
The initial edge list is just an empty `tibble()`.
```{r}
add_children_to_dag(oncotree_json[[1]], tibble())
```
Nothing is done to the `el` variable in `add_children_to_dag()` function yet, so it returns an empty data frame.
However, the `NODE_INFO` data frame should have the information for the first level of OncoTree.
```{r}
NODE_INFO
```
Success!
#### Add the node's children to the edge list
Now we need to start on the hard part, the recursive traversal of the DAG in the JSON.
To begin, we should add an if-statement to check if the node has children.
If it does, then we need to add the connections from this node to the children to the edge list `el`.
This is easily done by binding the existing `el` with a new tibble with "from" and "to" columns containing the name of the current node (from) and the names of the children (to).
Let's start with that and make sure it works.
```{r}
add_children_to_dag <- function(node, el) {
# Add node information to the `NODE_INFO` global variable.
extract_node_info(node)
if (length(names(node$children)) > 0) {
# Add this node and children to edge list.
el <- bind_rows(el, tibble(from = node$code, to = names(node$children)))
}
return(el)
}
```
```{r}
add_children_to_dag(oncotree_json[[1]], tibble())
```
Great! We can see that the connections from `"TISSUE"` to each of the top-level cancer groups were successfully added to the edge list.
Now we need to apply this function to each of the children of this node.
I do this with `map()` from the 'purrr' package (attached along with 'tidyverse').
It works similarly to `lapply()` from base R, but is a bit easier to manage, in my opinon (and it has some other useful helpers and capabilities that we don't use here.)
Basically, each child node is passed to `add_children_to_dag()` along with the edge list.
The node information for each child will be extracted and, if they have children, they will be sent through `add_children_to_dag()`, too.
Each time, an edge list is returned.
This is a recursive process and will naturally visit every node, building up the edge list through every "leaf" on the tree.
```{r}
add_children_to_dag <- function(node, el) {
# Add node information to the `NODE_INFO` global variable.
extract_node_info(node)
if (length(names(node$children)) > 0) {
# Add this node and children to edge list.
nodes_el <- bind_rows(el, tibble(from = node$code, to = names(node$children)))
# Repeat for children nodes.
childrens_el <- map(node$children, add_children_to_dag, el = el)
# Combine into one edge list.
el <- bind_rows(nodes_el, childrens_el)
}
return(el)
}
```
And that's it!
We should now be able to create the entire DAG.
```{r}
# reset `NODE_INFO`
NODE_INFO <- tibble()
# Run the recursive algorithm.
oncotree_el <- add_children_to_dag(oncotree_json[[1]], tibble())
oncotree_el
```
```{r}
NODE_INFO
```
#### Create the tidygraph
Just as before, the `tidygraph` object can be constructed from the edge list, followed by joining the node list information.
```{r}
oncotree_gr <- as_tbl_graph(oncotree_el, directed = TRUE) %N>%
full_join(NODE_INFO, by = c("name" = "code"))
```
This tidygraph object can now be saved for future reference.
```{r}
saveRDS(oncotree_gr, "msk_oncotree_tidygraph.rds")
```
## Visualization
To make the visualization a bit better, I mapped the colors extracted from the JSON to colors available in R.
```{r}
oncotree_colors <- tibble::tribble(
~ color, ~ new_color,
"black", "black",
"Black", "black",
"Blue", "blue",
"Cyan", "cyan",
"DarkRed", "darkred",
"Gainsboro", "#DCDCDC",
"Gray", "grey",
"Green", "green",
"HotPink", "hotpink",
"LightBlue", "lightblue",
"LightSalmon", "lightsalmon",
"LightSkyBlue", "lightskyblue",
"LightYellow", "lightyellow",
"LimeGreen", "limegreen",
"MediumSeaGreen", "mediumseagreen",
"Orange", "orange",
"PeachPuff", "#FFDAB9",
"Purple", "purple",
"Red", "red",
"SaddleBrown", "tan4",
"Teal", "#008080",
"White", "white",
"Yellow", "yellow"
)
oncotree_gr <- oncotree_gr %N>%
left_join(oncotree_colors, by = "color") %>%
select(-color) %>%
dplyr::rename(color = new_color)
```
Finally, we can use the 'ggraph' package to create some visualizations of the DAG.
Again, I am unable to fully explain 'ggraph' here, but the package vignettes are very good: [Data Imaginist - ggraph](https://www.data-imaginist.com/tags/ggraph).
The first plot below shows the OncoTree graph spreading radially from the center, each layer representing a further subdivision of the cancer type.
The colors roughly correspond to the tissue of origin.
```{r, fig.width=7, fig.height=7}
oncotree_gr %N>%
ggraph(layout = "tree", circular = TRUE) +
geom_edge_diagonal(color = "grey50", alpha = 0.5) +
geom_node_point(aes(color = color)) +
scale_color_identity() +
theme_graph()
```
Each of the subgraphs can also be separated by tissue of origin.
```{r, fig.width=7, fig.height=20, warning=FALSE, message='hide'}
oncotree_gr %N>%
filter(name != "TISSUE") %>%
morph(to_components) %>%
mutate(grp = tissue[which.max(level)]) %>%
unmorph() %>%
ggraph(layout = "tree") +
facet_nodes(~ grp, ncol = 4, scales = "free") +
geom_edge_diagonal(color = "grey50", alpha = 0.5) +
geom_node_point(aes(color = color)) +
scale_color_identity() +
theme_graph()
```
And below is an example of the subdivisions of lung cancer.
```{r, fig.width=7, fig.height=8}
oncotree_gr %N>%
filter(name != "TISSUE") %>%
morph(to_components) %>%
mutate(grp = tissue[which.max(level)]) %>%
unmorph() %N>%
filter(grp == "Lung") %>%
ggraph(layout = "tree") +
geom_edge_diagonal(color = "grey50") +
geom_node_label(aes(label = name, fill = color), size = 3,
repel = FALSE, label.r = unit(0.1, "lines")) +
scale_fill_identity() +
coord_flip() +
scale_y_reverse() +
theme_graph()
```