makeGOGraph {GOstats} | R Documentation |
The directed acyclic graph (DAG) based on finding the most specific terms for the supplied LocusLink IDs is constructed and returned. The constructuion is per GO ontology (there are three, MF, BP and CC) and once the most specific terms have been identified then all less specific terms are found (these are the parents of the terms) and then their parents and so on, until the root is encountered.
makeGOGraph(x, Ontology="MF", removeRoot = TRUE)
x |
A vector of LocusLink IDs. |
Ontology |
Which of the GO ontologies to use. |
removeRoot |
A logical value indicating whether the GO root nood should be removed or not. |
For each supplied LocusLink identifier all the GO annotations (in the specified ontology) are found.
The mappings are different for the different ontologies. Typically a GO indentifier is used only in one specific ontology.
The resulting structure is stored in a graph using the graph
package, again from Bioconductor.
An object that inherits from the graph
class. The particular
implementation is not specified.
R. Gentleman
The Gene Ontology Consortium
gN <- c("71733","224019", "237928", "11308") gg1 <- makeGOGraph(gN, "BP")