Difference between revisions of "User Guide/SObA"

From WormBaseWiki
Jump to navigationJump to search
Line 3: Line 3:
 
== What is a SObA graph? ==
 
== What is a SObA graph? ==
  
SObA is an abridged version of the ontology graph, trimmed based on annotations and hierarchical relationships.
+
SObA is an abridged version of a full ontology graph, trimmed based on annotations and hierarchical relationships.
  
 
Starting with the full ontology graph, we trim the graph by:  
 
Starting with the full ontology graph, we trim the graph by:  
Line 12: Line 12:
 
  (E), scaling node sizes based on the relative number of annotations that each node carries to indicate possible relative importance.
 
  (E), scaling node sizes based on the relative number of annotations that each node carries to indicate possible relative importance.
  
SObA graph is drawn with Cytoscape. The graph may be manipulated in the following ways.
+
The graph may be manipulated in the following ways.
  
1. zoom and move nodes around.
+
1. zoom and move nodes around.
 +
2. Select a node or edge for specific information.
 +
3. "Save Image" turns the graph into a high resolution PNG file.
 +
4. Node size scaling may be removed by ticking "Uniform".
 +
5. Displayed graph depth may be restricted at will.
 +
6. Graph display may be faceted by evidence types or ontology aspects (GO only).

Revision as of 20:45, 6 August 2019

Summary of Ontology-based Annotations (SObA)

What is a SObA graph?

SObA is an abridged version of a full ontology graph, trimmed based on annotations and hierarchical relationships.

Starting with the full ontology graph, we trim the graph by:

(A), removing all nodes (and their edges) that do not carry any (direct or inferred) annotations; 
(B), removing all nodes that do not have direct (as opposed to inferred) annotations unless they are the lowest common ancestral nodes of two or more descending nodes (lowest common ancestor, LCA); 
(C), applying transitive reduction by removing all paths between a pair of nodes unless they are the longest paths;
(D), reducing hierarchy depth to focus on broader aspects of ontology (top slicing).
(E), scaling node sizes based on the relative number of annotations that each node carries to indicate possible relative importance.

The graph may be manipulated in the following ways.

1. zoom and move nodes around.
2. Select a node or edge for specific information.
3. "Save Image" turns the graph into a high resolution PNG file.
4. Node size scaling may be removed by ticking "Uniform".
5. Displayed graph depth may be restricted at will.
6. Graph display may be faceted by evidence types or ontology aspects (GO only).