oneGOGraph              package:GOstats              R Documentation

_C_o_n_s_t_r_u_c_t _t_h_e _G_O _g_r_a_p_h _g_i_v_e_n _a _s_e_t _o_f _l_e_a_v_e_s.

_D_e_s_c_r_i_p_t_i_o_n:

     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.

_U_s_a_g_e:

     oneGOGraph(x, dataenv)
     GOGraph(x, dataenv)
     getGoGraph(p, goIds)

_A_r_g_u_m_e_n_t_s:

       x: A character vector of GO identifiers. 

 dataenv: An environment for finding the parents of that term. 

       p: A 'GOHyperGParams' instance.

   goIds: A character vector providing the GO term IDs.

_D_e_t_a_i_l_s:

     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.

_V_a_l_u_e:

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

_A_u_t_h_o_r(_s):

     R. Gentleman

_S_e_e _A_l_s_o:

     'makeGOGraph'

_E_x_a_m_p_l_e_s:

      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)

