Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms

Figure 10

A snapshot of ontology integration between GO and NDFRT by APPROXIMATE (depth = 6). Blue nodes are terms from GO and red nodes are terms from NDFRT. Solid lines are edges and dashed lines are paths consisting of 1 or more edges. In each bracket, the left part is the closeness score and the right part is the cohesion score.