buildGOgraph.topology {topGO} | R Documentation

## buils GO graph starting from the most specific GO terms

### Description

This function is building the GO graph starting from the most specific terms. The structure of the GO graph is build recursively.

### Usage

    buildGOgraph.topology(knownNodes, whichOnto = "BP")

### Arguments

`knownNodes` | character vector of GO terms
`whichOnto` | character string specifying one of the three GO ontologies: `"BP"`, `"MF"`, `"CC"`

### Value

An object of class `graphNEL-class` is returned. The graph is directed (the edges are from leaves to the root) and it contains all GO terms specific to `whichOnto` ontology.

### Author(s)

Adrian Alexa

### See Also

`topGOdata-class`, `buildLevels`, `mapGenes2GOgraph`, `annFUN`

[Package topGO version 1.8.1 Index]