- Open Access
DynGO: a tool for visualizing and mining of Gene Ontology and its associations
© Liu et al; licensee BioMed Central Ltd. 2005
- Received: 15 December 2004
- Accepted: 09 August 2005
- Published: 09 August 2005
A large volume of data and information about genes and gene products has been stored in various molecular biology databases. A major challenge for knowledge discovery using these databases is to identify related genes and gene products in disparate databases. The development of Gene Ontology (GO) as a common vocabulary for annotation allows integrated queries across multiple databases and identification of semantically related genes and gene products (i.e., genes and gene products that have similar GO annotations). Meanwhile, dozens of tools have been developed for browsing, mining or editing GO terms, their hierarchical relationships, or their "associated" genes and gene products (i.e., genes and gene products annotated with GO terms). Tools that allow users to directly search and inspect relations among all GO terms and their associated genes and gene products from multiple databases are needed.
We present a standalone package called DynGO, which provides several advanced functionalities in addition to the standard browsing capability of the official GO browsing tool (AmiGO). DynGO allows users to conduct batch retrieval of GO annotations for a list of genes and gene products, and semantic retrieval of genes and gene products sharing similar GO annotations. The result are shown in an association tree organized according to GO hierarchies and supported with many dynamic display options such as sorting tree nodes or changing orientation of the tree. For GO curators and frequent GO users, DynGO provides fast and convenient access to GO annotation data. DynGO is generally applicable to any data set where the records are annotated with GO terms, as illustrated by two examples.
We have presented a standalone package DynGO that provides functionalities to search and browse GO and its association databases as well as several additional functions such as batch retrieval and semantic retrieval. The complete documentation and software are freely available for download from the website http://biocreative.ifsm.umbc.edu/dyngo.
- Gene Ontology
- Leaf Node
- Semantic Similarity
- Annotation Database
- Semantic Retrieval
A large amount of data and information about genes and gene products has been stored in various molecular biology databases. To assist with the representation and integration of knowledge about genes and gene products, biological ontologies and tools have been developed. One such ontology is the Gene Ontology (GO) , which has become a major vocabulary for annotating genes and gene products in various databases, such as MGI (Mouse Genetic Informatics) , SGD (Saccharomyces Genome Database) , and RGD (Rat Genome Database) , as well as in protein databases such as UniProt (Universal Protein Resource) , and InterPro . Genes and gene products from these databases are annotated with GO terms, and GO annotations of genes or gene products are distributed through the GO website as "association files." The databases are referred to as "annotation databases" hereafter.
Annotating genes and gene products is laborious and requires biological expertise – curators need to understand the precise definition and usage of terms as well as their hierarchies in GO for accurate and consistent curation. A browsing tool with the functionality of retrieving descendants and ancestors of a specific GO term will help curators to select the most appropriate GO terms for annotating genes and gene products. Additionally, a tool that shows GO annotations for a list of specified genes and gene products may help the identification of common molecular functions, cellular components or biological processes among these genes and gene products.
At the same time, with more genes and gene products having been annotated, many applications have been developed to utilize GO annotations for knowledge discovery. Already over a dozen tools can be found from the GO website for browsing GO terms and GO annotations, and for microarray data analysis. While many tools are available for GO browsing, few allow users to dynamically interact with the retrieved results without losing previous pages; in most web-based tools, activating a link may replace or hide previous pages. A tool that can display GO browsing results in one single window would be helpful to investigate relevant information.
We have developed a tool, DynGO (Dyn amic GO), that allows users to dynamically interact with GO annotation data, and to browse all GO terms and annotations. Besides the standard search capability of AmiGO – the "official" GO interface, DynGO provides advanced functionalities such as retrieving and presenting GO annotations based on a list of genes and gene products, or a list of genes and gene products sharing similar GO annotations.
In the following, we describe the graphical user interface (GUI) of DynGO that supports dynamic functionalities of DynGO. Also, we present the semantic similarity of GO, which is used by DynGO for semantic retrieval.
The GUI of DynGO was adapted from an existing GUI package, DynTreeViewer [7, 8]. The viewer, written in JAVA, provides various dynamic tree views for displaying hierarchical data. The program provides functionalities that allow data to be filtered, sorted, deleted, and lifted.
The tree displayed by the DynTreeViewer provides frequency information (or other critical statistical information) for each tree node by combining the frequency counts of all of its child nodes. Various applications using the DynTreeViewer have been developed including a vocabulary development tool based on medical reports [7, 8] and a summarization tool for multiple medical reports . Major functionalities of DynTreeViewer that were incorporated into DynGO include tree lifting and tree sorting.
Tree sorting allows the user to view a sub-tree sorted according to the alphabetical (or reversed alphabetical) order, or sorted numerically according to frequency or other statistical information. The sorting functionality allows users to locate nodes easily in a tree.
GO and semantic similarity of GO terms
GO comprises three hierarchies that hold terms defining the basic concepts of molecular function, biological process, and cellular component, respectively. The terms, organized using a Directed Acyclic Graph (DAG), may have one or more parents with a relation type of either "is-a" or "part-of." GO terms are used to annotate entities in dozens of genomic and protein databases. The development of GO and its wide adoption for genome annotation makes it feasible to perform semantic retrieval from multiple databases (i.e., to retrieve entities with similar GO annotations as the query entity).
As with any other similarity search task, semantic retrieval requires the definition of a similarity measure for entities sharing similar GO annotations. In DynGO, we adapted one of the semantic similarity measures reported by Lord et al. , which is based on the notion of "information content" – i.e., a term in an ontology is more informative if the term and its descendants have fewer annotated genes or proteins. The GO annotation measure starts with a probability measure of each term t. Let D t be the collection of GO terms that are either t or its descendants Let A(t, c) be the occurrence of t annotations given a collection c. The probability of t in c, or p(t, c), is defined as:
Let CA(t1, t2) be the lowest common ancestor set for terms t1 and t2, since GO allows multiple parents for each term. The semantic similarity of two GO terms is defined as:
The similarity of two genes or gene products is then defined as the average similarity between GO annotations for them.
Server – preprocessor and GOEngine
Both the preprocessor and GOEngine were coded using PERL, an open source programming language. The Preprocessor dynamically downloads the GO distribution file go_YYYYMM-assocdb.rdf-xml.gz (YYYY stands for year and MM stands for month) from the GO ftp site and generates tables that are stored in BerkeleyDB, an open source database management system. Information stored in the database includes hierarchical relations, GO terms and attributes (e.g., names, synonyms, references, and definitions), and GO annotations and attributes (e.g., names and references) of genes and gene products. Some intermediate tables for semantic retrieval are also generated and stored, including the probability table of terms in collections shown in Formula 1 and the semantic similarity table storing the similarity of any pair of GO terms computed according to Formula 2. Note that the collection used to derive the probability of GO terms consists of all entries from annotation databases in the GO distribution file.
The GOEngine processes queries and generates trees. Two types of trees can be generated depending on the nature of the queries: a GO tree or an association tree. The GO tree arranges GO terms according to the GO hierarchies. The association tree arranges genes and gene products as leaf nodes of associated GO terms according to the GO hierarchies. In the current implementation, the GOEngine supports seven types of queries as listed below, with the function name followed by its argument(s) in parentheses.
Generate_GO () generates a GO tree consisting of all GO terms where a term may appear in multiple branches of the tree.
Generate_Assoc (AssocDB) creates an association tree for all genes and gene products in a given association database, AssocDB (e.g., MGI). GO terms not associated with genes and gene products in AssocDB are not shown in the tree. A gene entity may appear in multiple branches of the tree if it is annotated by multiple GO terms.
Retrieve_Genes (GeneIDs) creates an association tree for all genes and gene products from a list of GeneIDs in one or more annotation databases, where each GeneID is the unique identifier used in the corresponding association database (e.g., MGI:108111).
Retrieve_Relatives (GeneID, AssocDBs, Parameters) retrieves genes and gene products that are "relatives" of the GeneID based on similar GO annotations from a list of annotation databases (AssocDBs), and displays the related genes and gene products in an association tree. Several parameters are needed for the function: parameters that assign weight to each hierarchy (the default values are 0.4 for molecular function, 0.4 for biological process, and 0.2 for cellular components) and the similarity threshold value (the default value is 0.5).
Retrieve_Genes (GoTerm, AssocDBs) returns genes and gene products from a list of annotation databases (AssocDBs) for a query GO term (GoTerm), and displays the entities in an association tree.
Retrieve_Descendants (GoTerm) generates a GO tree consisting of all ancestors and descendants of a given GoTerm.
Retrieve_Search (QueryString, AssocDBs) searches IDs, terms, and attributes of all GO terms or genes and gene products in AssocDBs using a query string that can be a word or any identifier (such as GO identifiers or gene entity references). All matches found from GO or AssocDBs are displayed in a GO tree or an association tree.
Client – GOGUI
The TreeHolder can hold multiple trees, where each tree is displayed using DynTreeViewer. Figure 4b displays two trees, the GO tree and an association tree. The latter is obtained by the function Retrieve_Genes, where genes and gene products for GO term ion transporter activity were retrieved from three associated databases MGI, UniProt, and SGD. Other panels in GOGUI are also dynamically changed to indicate the current tree. The MGI website of a selected gene "MGI:108111" is shown at the WebPanel. Links shown in the website can also be activated.
We conducted an integrated system testing and analysis using the November 1, 2004 GO distribution file go_200411-assocdb.xml.gz . There were 18,017 GO terms in this distribution, which were used to annotate 1,004,671 genes and gene products from 17 different annotation databases. It took about 5 hours for the Preprocessor to prepare all database tables on a PC laptop running Window XP with a 1.6 GHz Intel processor and 512 MB of RAM. One of the most computing-intensive tasks is the construction of the similarity table, where the similarity of every pair of GO terms is computed and stored. Note that semantic retrieval operation is a kind of time-consuming when the number of records in the association database is over ten thousands. For users who do not have plans to use the semantic retrieval function of DynGO, a light version of the Preprocessor is available that can prepare tables much faster (i.e., in less than 10 minutes using the same laptop).
The basic searching and retrieving functionality of DynGO was tested by four users (bioinformatics researchers and PhD students). They were pleased that DynGO could instantly retrieve the GO hierarchy for a specific GO term and retrieve a GO annotation tree for a specific gene or gene product. It was commented that DynGO is easy to move around to gather information about GO terms as well as GO annotations for a specific gene or gene product since multiple views were held in one window. Some indicated that semantic retrieval was slow (longer than 5 minutes) when they used annotation databases with more than thousands of records.
Besides searching and browsing GO terms and GO annotation databases, the advanced functionalities of DynGO allow it to be used for applications where records are annotated using GO. Here, we illustrate through two applications: one is to visualize GO annotations of informative probe sets for microarray data analysis  and the other is in the study of complementing GO with PIRSF classification-based protein ontology .
We found that the majority of curated PIRSF families map to GO leaf nodes, many of which also share common GO leaf nodes. The PIRSF associations to GO nodes allow us to examine whether certain GO subtrees might need expansion if GO concepts are too broad and to identify missing GO nodes when entire groups of superfamilies cannot be mapped to existing GO terms. As an example, Figure 8a shows that nested under receptor activity (GO:0004872) is a leaf node estrogen receptor activity (GO:0030284), under which we can identify two distinctly different concepts estrogen receptor α and β (SF500101, SF500102) that are not represented in GO. Also identified are activities of several groups of gene products missed in GO: progesterone receptor (SF002528) of steroid hormone receptor activity (GO:0003707), and retinoid acid receptor RAR (SF036753) of retinoid acid receptor activity (GO:0003708). Furthermore, directly under receptor activity there is no concept for orphan nuclear receptor (ligand-independent nuclear receptor) activity, which encompasses a large group of gene products such as TR2 (SF002526) and SF-1 (SF002530).
PIRSF classification can also provide links between the three GO sub-ontologies, each of which presently has its own hierarchical organization with no relationships inter-connecting them. Figure 8b shows the PIRSF-centric view where estrogen receptor α (PIRSF500101) is annotated with GO terms in both molecular function and biological process, which connects the receptor binding (GO:0005102) of signal transducer activity (GO:0004871) with the steroid hormone receptor signaling pathway (GO:0030518) of signal transduction (GO:0007165).
In this paper, we adapted one of the similarity measures used by Lord et al  for semantic retrieval. We plan to investigate other similarity measures for GO terms (e.g., the tree similarity measure used by Wang and Zhao ) and incorporate them into DynGO. Note that we include the evidence code when displaying the trees. Researchers that wish to filter out the annotations whose evidence codes are IEA can lift the tree according to the evidence code so that IEA annotations can be deleted from the tree.
Many software tools have been developed for GO, most of which are web-based browsing systems. Some of these web-based systems do not provide tree navigation where all GO terms are loaded; instead, the browsing is limited only to queries of a single GO term as in GenNav . Other systems provide navigation function for all GO terms but do not accept queries, such as the GO Browser developed at NCI's Cancer Genome Anatomy Project. A few tools do accept queries and have full tree navigation, such as the MGI GO Browser , but the results are shown in flat-tables so that users cannot directly inspect relations among multiple GO terms or genes and gene products. Additionally, all such web-based systems depend on Internet connection and may experience slow response time.
There is one standalone tool that is similar to DynGO, the Berkeley Drosophila Genome Project (BDGP) DAG-EDIT . Both tools are JAVA-based and display search results in tree views. DAG-EDIT, however, is designed as an editor for GO term editing; therefore, it does not provide the functionality for browsing genes and gene products in association trees and for dynamically linking to the websites. DynGO, on the other hand, is for querying, visualizing, and mining GO terms as well as GO annotations from annotation databases. DynGO enables GO curators and users to load multiple trees, and to dynamically obtain views in different orientations for the resulting trees.
Note that few of the existing tools support semantic retrieval (i.e., to retrieve genes and gene products sharing similar annotations), batch retrieval (i.e., to retrieve GO annotations for a list of entities), or allow users to dynamically display trees with different orientations at the same time. These features distinguish DynGO from other tools.
Several GO mining tools are available. These include GoMiner , MAPPFinder , FatiGO , and GoSurfer . Zeeberg et al.  did an extensive comparison of GoMiner with some of these mining tools. Here, we concentrate on comparing GoMiner and DynGO. GoMiner is a program package that organizes a list of interesting genes for biological interpretation using GO. It includes statistical analysis and two visualizations: a hierarchical tree view and a DAG view. While DynGO does not perform advanced statistical analysis, it can display the GO annotation trees for a gene list identified and exported from other software. GO terms for clusters of differentially expressed genes can be easily detected using the statistical information provided in the tree, either from the leaf descendant statistics or from the microarray data analysis software. Instead of providing two views as in GOMiner, we present the result in one tree that can be manipulated dynamically to change the orientation or to display information such as definitions or associated websites of a node. DynGO is flexible in the sense that it can be coupled with any microarray data analysis software to display the GO annotation for informative genes. Meanwhile, it combines well with browsing functionality and allows users to view the overall GO tree structure.
In the future, we will extend DynGO to incorporate microarray data analysis software on the server side to allow advanced microarray data analysis. Additionally, we plan to improve DynGO by collecting comments and feedback from the GO community. A formal usability evaluation is also planned.
We have presented a standalone package DynGO that provides functionalities to search and browse GO and its association databases as well as several additional functions such as batch retrieval and semantic retrieval. It enables users to browse the whole GO as well as GO annotations for many genomics and protein databases. It also includes statistical measures such as the number of leaf nodes and the probability of a specific GO term being assigned for a given collection. The results are displayed as trees that can be sorted; or users can dynamically obtain views with different orientations. For GO curators, curators of genomic and protein annotation databases, and users who use GO frequently, DynGO provides fast and convenient access to the GO and gene entity data since the data are located locally (the same computer or a computer on a local intranet) and the DynGO interface holds all results inside one browsing window. DynGO can also be extended to view any other data sets where the GO annotations are available.
Project name: DynGO
Project homepage: http://biocreative.ifsm.umbc.edu/dyngo/
Operating systems: platform independent, tested on Window XP system and Red Hat Linux System
Programming language: Perl, Java
Other requirements: Java version 1.4, Perl version 5.8, Berkeley DB, Perl model BerkeleyDB
License: GNU GPL
Any restriction to use by non-academics: license needed.
Documentation, the source code of the server, and the executable of the client are available in the project website [also see Additional files]. Other used software components are available at the according sources.
The project is supported by grant IIS-0430743 from the National Science Foundation.
- Harris MA, Clark J, Ireland A, Lomax J, Ashburner M, Foulger R, Eilbeck K, Lewis S, Marshall B, Mungall C, Richter J, Rubin GM, Blake JA, Bult C, Dolan M, Drabkin H, Eppig JT, Hill DP, Ni L, Ringwald M, Balakrishnan R, Cherry JM, Christie KR, Costanzo MC, Dwight SS, Engel S, Fisk DG, Hirschman JE, Hong EL, Nash RS, Sethuraman A, Theesfeld CL, Botstein D, Dolinski K, Feierbach B, Berardini T, Mundodi S, Rhee SY, Apweiler R, Barrell D, Camon E, Dimmer E, Lee V, Chisholm R, Gaudet P, Kibbe W, Kishore R, Schwarz EM, Sternberg P, Gwinn M, Hannick L, Wortman J, Berriman M, Wood V, de la Cruz N, Tonellato P, Jaiswal P, Seigfried T, White R: The Gene Ontology (GO) database and informatics resource. Nucleic Acids Res 2004, 32(Database issue):D258–61.PubMedGoogle Scholar
- Bult CJ, Blake JA, Richardson JE, Kadin JA, Eppig JT, Baldarelli RM, Barsanti K, Baya M, Beal JS, Boddy WJ, Bradt DW, Burkart DL, Butler NE, Campbell J, Corey R, Corbani LE, Cousins S, Dene H, Drabkin HJ, Frazer K, Garippa DM, Glass LH, Goldsmith CW, Grant PL, King BL, Lennon-Pierce M, Lewis J, Lu I, Lutz CM, Maltais LJ, McKenzie LM, Miers D, Modrusan D, Ni L, Ormsby JE, Qi D, Ramachandran S, Reddy TB, Reed DJ, Sinclair R, Shaw DR, Smith CL, Szauter P, Taylor B, Vanden Borre P, Walker M, Washburn L, Witham I, Winslow J, Zhu Y: The Mouse Genome Database (MGD): integrating biology with the genome. Nucleic Acids Res 2004, 32(Database issue):D476–81. 10.1093/nar/gkh125PubMed CentralView ArticlePubMedGoogle Scholar
- Cherry JM, Adler C, Ball C, Chervitz SA, Dwight SS, Hester ET, Jia Y, Juvik G, Roe T, Schroeder M, Weng S, Botstein D: SGD: Saccharomyces Genome Database. Nucleic Acids Res 1998, 26: 73–79. 10.1093/nar/26.1.73PubMed CentralView ArticlePubMedGoogle Scholar
- Twigger S, Lu J, Shimoyama M, Chen D, Pasko D, Long H, Ginster J, Chen CF, Nigam R, Kwitek A, Eppig J, Maltais L, Maglott D, Schuler G, Jacob H, Tonellato PJ: Rat Genome Database (RGD): mapping disease onto the genome. Nucleic Acids Res 2002, 30: 125–128. 10.1093/nar/30.1.125PubMed CentralView ArticlePubMedGoogle Scholar
- Apweiler R, Bairoch A, Wu CH, Barker WC, Boeckmann B, Ferro S, Gasteiger E, Huang H, Lopez R, Magrane M, Martin MJ, Natale DA, O'Donovan C, Redaschi N, Yeh LS: UniProt: the Universal Protein knowledgebase. Nucleic Acids Res 2004, 32(Database issue):D115–9. 10.1093/nar/gkh131PubMed CentralView ArticlePubMedGoogle Scholar
- Apweiler R, Attwood TK, Bairoch A, Bateman A, Birney E, Biswas M, Bucher P, Cerutti L, Corpet F, Croning MD, Durbin R, Falquet L, Fleischmann W, Gouzy J, Hermjakob H, Hulo N, Jonassen I, Kahn D, Kanapin A, Karavidopoulou Y, Lopez R, Marx B, Mulder NJ, Oinn TM, Pagni M, Servant F, Sigrist CJ, Zdobnov EM: The InterPro database, an integrated documentation resource for protein families, domains and functional sites. Nucleic Acids Res 2001, 29: 37–40. 10.1093/nar/29.1.37PubMed CentralView ArticlePubMedGoogle Scholar
- Friedman C, Liu H, Shagina L: A vocabulary development and visualization tool based on natural language processing and the mining of textual patient reports. J Biomed Inform 2003, 36: 189–201. 10.1016/j.jbi.2003.08.005View ArticlePubMedGoogle Scholar
- Liu H, Friedman C: A method for vocabulary development and visualization based on medical language processing and XML. Proc AMIA Symp 2000, 502–506.Google Scholar
- Liu H, Friedman C: CliniViewer: a tool for viewing electronic medical records based on natural language processing and XML. Medinfo 2004, 11: 639–643.Google Scholar
- Lord PW, Stevens RD, Brass A, Goble CA: Investigating semantic similarity measures across the Gene Ontology: the relationship between sequence and annotation. Bioinformatics 2003, 19: 1275–1283. 10.1093/bioinformatics/btg153View ArticlePubMedGoogle Scholar
- Go archive distribution on November 01, 2004[http://archive.godatabase.org/full//2004–11–01/go_200411-assocdb.xml.gz]
- Kuriakose MA, Chen WT, He ZM, Sikora AG, Zhang P, Zhang ZY, Qiu WL, Hsu DF, McMunn-Coffran C, Brown SM, Elango EM, Delacure MD, Chen FA: Selection and validation of differentially expressed genes in head and neck cancer. Cell Mol Life Sci 2004, 61: 1372–1383. 10.1007/s00018-004-4069-0View ArticlePubMedGoogle Scholar
- Nikolskaya AN: Complementing Gene Ontology With PIRSF Classification-based Protein Ontology. 2004.Google Scholar
- TIGR Resource website2004. [ftp://ftp.tigr.org/pub/data/tgi/Resourcerer/Human]
- Wu CH, Nikolskaya A, Huang H, Yeh LS, Natale DA, Vinayaka CR, Hu ZZ, Mazumder R, Kumar S, Kourtesis P, Ledley RS, Suzek BE, Arminski L, Chen Y, Zhang J, Cardenas JL, Chung S, Castro-Alvear J, Dinkov G, Barker WC: PIRSF: family classification system at the Protein Information Resource. Nucleic Acids Res 2004, 32: D112–4. 10.1093/nar/gkh097PubMed CentralView ArticlePubMedGoogle Scholar
- Wang L, Zhao J: Parametric alignment of ordered trees. Bioinformatics 2003, 19: 2237–2245. 10.1093/bioinformatics/btg305View ArticlePubMedGoogle Scholar
- MGI GO Browser[http://www.informatics.jax.org/searches/GO_form.shtml]
- Zeeberg BR, Feng W, Wang G, Wang MD, Fojo AT, Sunshine M, Narasimhan S, Kane DW, Reinhold WC, Lababidi S, Bussey KJ, Riss J, Barrett JC, Weinstein JN: GoMiner: a resource for biological interpretation of genomic and proteomic data. Genome Biol 2003, 4: R28. 10.1186/gb-2003-4-4-r28PubMed CentralView ArticlePubMedGoogle Scholar
- Doniger SW, Salomonis N, Dahlquist KD, Vranizan K, Lawlor SC, Conklin BR: MAPPFinder: using Gene Ontology and GenMAPP to create a global gene-expression profile from microarray data. Genome Biol 2003, 4: R7. 10.1186/gb-2003-4-1-r7PubMed CentralView ArticlePubMedGoogle Scholar
- Al-Shahrour F, Diaz-Uriarte R, Dopazo J: FatiGO: a web tool for finding significant associations of Gene Ontology terms with groups of genes. Bioinformatics 2004, 20: 578–580. 10.1093/bioinformatics/btg455View ArticlePubMedGoogle Scholar
- Zhong S, Li C, Wong WH: ChipInfo: Software for extracting gene annotation and gene ontology information for microarray analysis. Nucleic Acids Res 2003, 31: 3483–3486. 10.1093/nar/gkg598PubMed CentralView ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.