distCGO {GOstats}R Documentation

Distances between GO graphs

Description

These functions provide different ways of measuring the distance between two GO graphs. See oneGOGraph for a description of how these graphs are constructed.

Usage

distCGO(term1, term2, dataenv)
distDGGO(term1, term2, dataenv)

Arguments

term1 The term used to construct the first graph.
term2 The term used to construct the second graph.
dataenv The data used to construct both graphs.

Details

A number of distances between induced GO graphs have been considered in the literature. A basic idea behind these distances is to convey some information about the relatedness of the terms (or possibly of the genes annotated at those terms) using these distance measures.

For distDGGO the distance is the number of nodes in the intersection of the two induced graphs divided by the number of nodes in the union of the two graphs.

For distCGO the distance is not yet implemented.

Value

A numeric value indicating the distance between term1 and term2.

Author(s)

R. Gentleman

References

(1) Cheng et al, Affymetrix. (2) B. Ding and R. Gentleman

See Also

oneGOGraph, makeGOGraph

Examples

 distDGGO("GO:0005488", "GO:0030528", GOMFPARENTS)

 distDGGO("GO:0003700", "GO:0030528", GOMFPARENTS)


[Package Contents]