oneGOGraph: Construct the GO graph given a set of leaves.
In GOstats: Tools for manipulating GO and microarrays

Description Usage Arguments Details Value Author(s) See Also Examples

Given one or more GO identifiers (which indicate the leaves in the graph) and a set of mappings to the less specific sets of nodes this function will construct the graph that includes that node and all children down to the root node for the ontology.

1 2	oneGOGraph(x, dataenv) GOGraph(x, dataenv)

`x`	A character vector of GO identifiers.
`dataenv`	An environment for finding the parents of that term.

For any set of GO identifiers (from a common ontology) we define the induced GO graph to be that graph, based on the DAG structure (child - parent) of the GO ontology of terms, which takes the most specific set of GO terms that apply (for that ontology) and then joins these to all less specific terms. These functions help construct such graphs.

The induced GO graph (or NULL) for the given GO identifier.

R. Gentleman

makeGOGraph

 library("GO.db")
 g1 <- oneGOGraph("GO:0003680", GOMFPARENTS)
 g2 <- oneGOGraph("GO:0003701", GOMFPARENTS)
 g3 <- join(g1, g2)

 g4 <- GOGraph(c("GO:0003680", "GO:0003701"), GOMFPARENTS)
if( require("Rgraphviz") && interactive() )
  plot(g3)