In other words, a bimap is a bipartite graph.
Here are some examples: 1. bimap B1:
4 left objects (Lkeys): "a", "b", "c", "d" 3 objects on the right (Rkeys): "A", "B", "C"
Links (edges): "a" <--> "A" "a" <--> "B" "b" <--> "A" "d" <--> "C"
Note that: - There can be any number of links starting from or ending at a given object. - The links in this example are untagged. 2. bimap B2:
4 left objects (Lkeys): "a", "b", "c", "d" 3 objects on the right (Rkeys): "A", "B", "C"
Tagged links (edges): "a" <-"x"-> "A" "a" <-"y"-> "B" "b" <-"x"-> "A" "d" <-"x"-> "C" "d" <-"y"-> "C"
Note that there are 2 links between objects "d" and "C": 1 with tag "x" and 1 with tag "y".
Note that both AnnDbBimap and FlatBimap objects have a read-only semantic: the user can subset them but cannot change their data.
Note to the AnnotationDbi maintainers/developpers: the checkProperty0
function (AnnDbPkg-checker.R file) checks that Property0 is satisfied on all
the AnnDbBimap objects defined in a given package (FIXME: checkProperty0 is
currently broken).
library(hgu95av2.db)
ls(2)
hgu95av2GO # calls the "show" method
summary(hgu95av2GO)
hgu95av2GO2PROBE # calls the "show" method
summary(hgu95av2GO2PROBE)
Run the code above in your browser using DataLab