Skip to main content

Table 1 Partial Order Constraints

From: A relation based measure of semantic similarity for Gene Ontology annotations

 

Situation

Ordering

Directly*

T i IS T j

ρ(T i ) ≤ ρ(T j )

 

T i PART T j

ρ(T i ) ≤ ρ(T j )

 

T i MIXED T j via T k

ρ(T i ) ≤ ρ(T k ) ≤ ρ(T j )

Indirectly Via T lca *

T i IS T lca , T j IS T lca

ρ(T i ), ρ(T j ) ≤ ρ(T lca )

 

T i PART T lca , T j IS T lca

ρ(T i ) ≤ ρ(T j ) ≤ ρ(T lca )

 

T i PART T lca , T j PART T lca

ρ(T i ), ρ(T j ) ≤ ρ(T lca )

 

T i MIXED T lca via T k , T j IS T lca

(ρ(T i ) ≤ ρ(T k )), ρ(T j ) ≤ ρ(T lca )

 

T i MIXED T lca via T k , T j PART T lca

ρ(T i ), ρ(T j ) ≤ ρ(T k ) ≤ ρ(T lca )

 

T i MIXED T lca via T k , T j MIXED T lca via T m

(ρ(T i ) ≤ ρ(T k )), (ρ(T j ) ≤ ρ(T m )) ≤ ρ(T lca )

  1. Overview of general forms of relation based ordering for directly and indirectly related terms. Terms are indirectly related via a common ancestor term T lca . Instances of terms T i and T j may be part of the common ancestor T lca via terms T k and T m respectively. ρ denotes a function that measures the number of instances (our source of descriptiveness) of terms. These orderings assume complete knowledge of all instances associated with a term.