Resolution: standard / high
Figure 3.
Downward Graph Construction. Given a particular GO term as an initial node, two subgraphs of the initial node as a root is constructed from two versions of GO. These two subgraphs are merged together and colour-coded subsequently.
Park et al. BMC Bioinformatics 2008 9(Suppl 3):S7 doi:10.1186/1471-2105-9-S3-S7