This graph should probably be sub-classed as an ontology, and the connecting and abstract bits should be shifted around.
NOTE: This uses term2term as the primary engine and should be considered deprecated.
Returns the root nodes.
Boolean on acc.
Gets a term from a string.
TODO: should be able to take string or object.
In: acc. Out: Children term list.
In: acc, acc. Out: int.
Takes term. Gets the term2term links from a term.
With an array ref of terms, will climb to the top of the ontology (with an added 'all' stopper for GO).
This returns an array of three things: *) a link list *) a term (node) *) a hashref of of nodes in terms of in-graph descendants
TODO: should also be able to take array ref of strings...
1 POD Error
The following errors were encountered while parsing the POD:
'=item' outside of any '=over'
=over without closing =back
To install GOBO, copy and paste the appropriate command in to your terminal.
cpanm
cpanm GOBO
CPAN shell
perl -MCPAN -e shell install GOBO
For more information on module installation, please visit the detailed CPAN module installation guide.