Table 6 Classification of GO Graphs (C# denotes criterion number)
From: GRank: a middleware search engine for ranking genes by relevance to given genes
C# | GO Graph criterion |
|---|---|
1 | All KCs in the GO Graph connect to their ancestor GO term nodes by “is-a” relations only |
2 | All KCs in the GO Graph connect to their ancestor GO term nodes by “part-of” relations only |
3 | KCs in the GO Graph connect to their ancestor GO term nodes by both, “is-a” and “part-of” relations. |
4 | KCs are in shallow hierarchical levels in the GO Graph. We consider a hierarchical level is shallow if it is less than six |
5 | KCs are in deep hierarchical levels in the GO Graph |
6 | Some KCs are in deep hierarchical levels in the GO Graph and others are in shallow levels |