![]() | ![]() |
Formats:
|
||||||||||
Copyright © 2007 The Author(s) VisANT 3.0: new modules for pathway visualization, editing, prediction and construction 1Center for Advanced Genomic Technology, Boston University, Boston, MA 02215, USA, 2Bioinformatics Center, Institute for Chemical Research, Kyoto University, Japan, 3Department of Biomolecular Engineering, University of California, Santa Cruz, CA 95064, USA and 4Human Genome Center, Institute of Medical Science, University of Tokyo, Japan *To whom correspondence should be addressed. Phone: +617 353 1122, Fax: +617 353 3333, Email: delisi/at/bu.edu Present address: Joe Mellor, Department of Biological Chemistry and Molecular Pharmacology, Harvard Medical School, Boston, MA 02115, USA Received January 31, 2007; Revised April 9, 2007; Accepted April 12, 2007. This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. This article has been cited by other articles in PMC.Abstract With the integration of the KEGG and Predictome databases as well as two search engines for coexpressed genes/proteins using data sets obtained from the Stanford Microarray Database (SMD) and Gene Expression Omnibus (GEO) database, VisANT 3.0 supports exploratory pathway analysis, which includes multi-scale visualization of multiple pathways, editing and annotating pathways using a KEGG compatible visual notation and visualization of expression data in the context of pathways. Expression levels are represented either by color intensity or by nodes with an embedded expression profile. Multiple experiments can be navigated or animated. Known KEGG pathways can be enriched by querying either coexpressed components of known pathway members or proteins with known physical interactions. Predicted pathways for genes/proteins with unknown functions can be inferred from coexpression or physical interaction data. Pathways produced in VisANT can be saved as computer-readable XML format (VisML), graphic images or high-resolution Scalable Vector Graphics (SVG). Pathways in the format of VisML can be securely shared within an interested group or published online using a simple Web link. VisANT is freely available at http://visant.bu.edu. INTRODUCTION Biological pathways are often represented as pixel images (JPEG, GIF, etc.) or vector graphics (Scalable Vector Graphics (SVG) or PostScript). Typical examples of such static representations include those presented in databases such as KEGG (1), Reactome (2), BioCarta (http://www.biocarta.com) and EcoCyc (3). Although a static representation is intuitive and informative and has been widely used in textbooks and illustrations, it is difficult to edit, or to reuse for analysis, modeling and simulation. As a result, important resources such as the KEGG database cannot be fully exploited. Notable steps toward meeting the challenge of computable representations include the development of BioPAX (Biological Pathways Exchange, http://www.biopax.org/) and KGML (KEGG Markup Language, http://www.genome.jp/kegg/xml/) with BioPAX focusing on detailed ontology while KGML includes layout information. A number of software tools (4–9) have been developed to visually build computable models of pathways. These tools are usually based on graphical models in which nodes represent genes, proteins or chemical compounds, and edges represent various types of interactions or associations. To date, few tools support the conditional dependencies of molecular and genetic entities and their associations. Thus, pathways encoded with existing tools may lack key information needed for interpreting the pathway's functioning. In order to combine multiple pathways in a manner that is useful for modeling cellular behavior, two main challenges must be addressed. First, models must allow a hierarchical visual representation (6,10–12). Second, data representation is complicated when several complexes share some of their proteins, because the role of a common protein generally depends on context (13,14). Methods such as semantic zooming or hierarchical decomposition (10,12,15–20) are needed to aggregate and abstract entire pathways or pathway portions into small units that can be displayed within larger pathway systems. Hierarchical structures are also very common in the computable representation of biological knowledge in BioPAX and KGML formats. A protein complex must often be represented as a node containing a set of nodes, one for each subunit. Each subunit in turn may itself contain a set of nodes representing conserved domains identified in the subunit's 3D structure or primary sequence. Representing a protein complex as a simple, non-hierarchical, node often obscures properties of the proteins because attributes of the simple node are aggregated across multiple proteins, each of which may have different attributes with respect to one another. An obvious workaround for this issue is to model protein complexes as ‘compound nodes’(10,11,15) or ‘metanodes’, which are nodes with recursive internal structure (Figure 1
While biological systems contain an appreciable amount of hierarchical organization, molecular components are reused across subsystems, making it impossible to perfectly capture all of the information into a nested set of relations. Strict hierarchical representations can capture biological substructure but cannot model overlap between protein complexes. Related to this idea, nodes that represent only a single protein may not have a unique state but may instead behave in a condition-dependent manner. It is common practice (21) to use multiple nodes to represent different states of the same protein to maintain clarity of control logic and conditional dependency in pathways. However, this can lead to an explosively growing chain of nodes. It also breaks data integrity and introduces data redundancy, as the same protein is represented by multiple nodes. More importantly, the exact conditional-dependent state of a given protein can be unclear or unknown in many pathways. A typical example can be found for protein STE20 in the MAKP signaling pathway for yeast (http://www.genome.ad.jp/dbget-bin/show_pathway?sce04010+YHL007C), which most likely has different activities under different conditions, but the exact nature of the state differences is currently unknown. How can such conditional dependencies be represented and modified when corresponding biological information becomes available? Protein–protein interaction data sets obtained from either large-scale experiments or computational predictions, as well as coexpressed genes predicted from large-scale expression data, can be used to help fill gaps in incomplete pathways (22–25). Although many tools provide facilities to visualize expression data in the context of pathways (4,5,7,9,26), facilities to enrich pathways in a computationally based visualization system, using both interaction and expression profiles, are missing. Here we report new developments in VisANT 3.0, a Web-based platform with new modules supporting exploratory pathway analysis using metagraphs (20) to address multi-scale visualization of multiple pathways; editing and annotating pathways using a KEGG compatible visual notation; visualization of expression data in the context of pathways; enriching pathways using either coexpressed components of known pathway members predicted from expression data in the SMD (27) and GEO (28) databases or proteins with known physical interactions and assigning genes/proteins of unknown function to known pathways. The new version of VisANT will help users take full advantage of the large number of available resources in the KEGG pathway database when building new pathways. METHODS Metagraphs A metagraph is a data structure for representing nodes, edges and subnetworks in a nested structure. One significant difference between a compound graph and a metagraph is that metagraphs allow one node to have multiple instances and these instances are automatically tracked. This capability allows a metanode in a metagraph to share nodes: each metanode has its own instance of the same node. Metanodes have two semantic states: an expanded state that reveals the associated subgraph inside, and a contracted state that hides the internal structure, rendering the metanode as a simple node. Edges between the nodes in an expanded metanode have the usual meaning (associations based on experimental data or computationally inferred correlations); edges between metanodes either reflect a correlation between standard (hidden) nodes or indicate that the same gene/protein occurs in both metanodes (20). KGML and pathway integration tools KGML is an exchange format for KEGG graph objects, particularly KEGG pathways, which are manually drawn and updated. The KGML files for KEGG metabolic pathways specify how enzymes (boxes) are linked by a relation and how compounds (circles) are linked by a reaction. In contrast, the KGML files for KEGG regulatory pathways contain only the former. KGML files for all supported species in VisANT have been preprocessed to map genes to their KEGG pathways, and a VisANT user can identify pathways for a specified gene either by searching for its interactions or resolving (normalizing) its names or IDs as explained subsequently. Two pathway recommendation web services for identifying functionally related genes from transcriptional profiles are integrated in VisANT through its plugin architecture (20). Given a set of query genes, typically the known genes of a pathway, these services recommend additional genes in the same pathway as the query set. Both search engines support five species: Homo sapiens, Mus musculus, Drosophila melanogaster, Caenorhabditis elegans and Saccharomyces cerevisiae. When VisANT is run as an online applet, connections to the services are mediated by the VisANT server. GeneRecommender (29) discovers new genes with similar function to a given list of genes (the query) already known to have closely related function. It ranks genes according to how strongly they correlate with a set of query genes in those experiments for which the query genes are most strongly coregulated. ClueGene (30) uses the pattern of how genes cluster together in sets of experiments to recommend new genes in a pathway. ClueGene bases its recommendations on the query set and on a cluster compendium. Each set of experiments is clustered independently. The collection of clusters constitutes the cluster compendium. Each gene in the genome is given a co-clustering score. Higher scoring genes are more highly recommended and tend to be found in small clusters in the cluster compendium along with query genes. The use of VisANT (20,31,32) to mine, integrate and display biological interactions based on KEGG pathways and expression data is facilitated by a name-normalization service which resolves IDs used by different databases. In addition, customized ID mappings, as well as corresponding Web links, can be easily added to the network through a simple tab-delimited format. VisANT is developed using Java technology. In addition to the Web browser applet interface, VisANT can also be run as a stand-alone application which implements an auto-upgrading detection system to keep it up-to-date. Detailed information on VisANT's three-tier structure (31) and plugin framework(20) can be found at http://visant.bu.edu. In addition, a new error-reporting system has been implemented to enhance the integration reliability of distributed systems: users will have the option to report critical errors to the plugin authors and VisANT team. INPUT AND OUTPUT Input VisANT automatically recognizes the format of an input file based on its content. Only those formats that related with the new functions will be discussed here. The full list of supported files can be found in VisANT's web site. Pathways can be loaded into VisANT using several different input methods as detailed in Figure 2
Output All data shown in VisANT can be saved in an XML format using the VisANT Markup Language (VisML). Registered users can save the network on the VisANT server so that it can be accessed wherever the internet is available. VisML uses a version number to facilitate compatibility and extensibility. A description of VisML can be found at http://visant.bu.edu. In addition, pathways can be exported without visual information, as tab-delimited edge and node lists. Pathways can also be saved as pixel images, or as high-quality SVG for publication and illustration. An SVG file can be further polished with an SVG editor. PROGRAM DESCRIPTION Pathway visualization, navigation and editing Each pathway is represented as a metanode which may be nested within other metanodes (Figure 1 VisANT adopts the KEGG notation for graphics annotation so that users will have consistent views of the KEGG pathways. However, a few changes were necessary. In particular, a single protein/gene is represented as a filled green circle, and a metanode displayed as a green box is used to represent multiple proteins/genes. Additionally, the number of proteins/genes contained in a metanode can be revealed by double-clicking the box. Use of a metanode for a protein complex is also introduced (Figure 3
Pathways can be easily edited in VisANT. Nodes and edges can be modified, added or deleted. Additional components can be added to pathways by a simple drag and drop. Pathways can be easily ungrouped or regrouped as one large pathway, depending on the user's needs. Multi-scale visualization, pathway overview and crosstalk As with the extension of interactions for a given protein/gene, pathways can be extended by double-clicking on a pathway node. Using this method, a network of pathways can be quickly constructed. Figure 1 Because the state of a metanode can be toggled by mouse-clicking, an overview of the pathway shown in Figure 1 Overlaying expression data VisANT provides two methods to visualize expression data over pathways: either the node color is used to represent the expression value in a particular experiment, or a plot of the expression profile is embedded in the node, as shown in Figure 3 In VisANT it is convenient to determine whether genes in the same pathway are coexpressed, as all the expression profiles of the nodes contained in a metanode (pathway), as well as the average profile, are drawn together as one plot with average profiles in black. Figure 3 Pathway prediction Sets of genes in the same pathway are often activated together and may have very similar expression profiles; their protein products may also interact, either physically or functionally, to achieve a specific task. VisANT provides functions to assign genes/proteins with unknown function to the known KEGG pathways based on these observations. Predictome (33) can easily be queried for sets of proteins that interact either functionally or physically with a specified protein. VisANT also has editing capabilities that allow any such set to be augmented with a user's own data set. Genes with similar expression profiles can be identified using the ClueGene and GeneRecommender plugins and the genes so identified can be associated with one or another KEGG pathway in accordance with user specified criteria based on either functional or physical links (Figure 2 We suggest that users test the coexpression of query genes with known genes in the potential pathways and compare scores using either ClueGene or GeneRecommender. In addition, expression profiles can be compared if query genes are searched using GeneRecommender. Pathway construction, enrichment and update New pathways can be created from scratch or from relevant KEGG pathways, the latter of course being substantially more convenient because of KEGG documentation. In collaboration with the KEGG, the VisANT web site lists all pathways for which KGML is available, allowing easy access and loading into VisANT (Figure 2 We next describe a use-case scenario to illustrate some of the new features of VisANT. Suppose a user is interested in the γ-secretase complex which acts in the H. sapiens notch signaling pathway (Figure 3 In addition, pathways can be updated against the KEGG database so that the latest pathway information can be easily incorporated into existing pathways customized by the users. FUTURE DEVELOPMENT Among our goals for further development of VisANT is supporting pathways from other databases, including Reactome (2), BioCarta (http://www.biocarta.com), EcoCyc (3) and INOH (http://www.inoh.org/). Since computable representations of pathways from these databases are available in BioPAX format, one way to proceed would be to increase VisANT's support of BioPAX. This will require developing an automatic layout algorithm since BioPAX, unlike KGML, does not contain layout information. More importantly, a standard visual notation for different types of nodes and edges will also need to be developed for different types of biological components, and for the relations between them. Second, unlike KGML in which each pathway is usually stored in its own file, pathways in BioPAX format are usually represented in one large file which can exceed 100 MB, making it impractical to load them all at once and also preventing exploratory navigation of pathways. New efforts, such as the latest developments in CPath (http://cbio.mskcc.org/cpath/home.do) have made significant progress to overcome this problem by providing corresponding Application Programming Interfaces (APIs) that can retrieve pathways one by one in the format of BioPAX. We expect obstacles discussed above will be removed in the near future and pathways from these databases will be ready for use in VisANT.AVAILABILITY VisANT along with the full user manual and tutorials are available on the VisANT web site, http://visant.bu.edu Conflict of interest statement. None declared. [Supplementary Material]
REFERENCES 1. Kanehisa M, Goto S, Hattori M, Aoki-Kinoshita KF, Itoh M, Kawashima S, Katayama T, Araki M, Hirakawa M. From genomics to chemical genomics: new developments in KEGG. Nucleic Acids Res. 2006;34:D354–D357. [PubMed] 2. Joshi-Tope G, Gillespie M, Vastrik I, D’Eustachio P, Schmidt E, de Bono B, Jassal B, Gopinath GR, Wu GR, et al. Reactome: a knowledgebase of biological pathways. Nucleic Acids Res. 2005;33:D428–D432. [PubMed] 3. Keseler IM, Collado-Vides J, Gama-Castro S, Ingraham J, Paley S, Paulsen IT, Peralta-Gil M, Karp PD. EcoCyc: a comprehensive database resource for Escherichia coli. Nucleic Acids Res. 2005;33:D334–D337. [PubMed] 4. Chung HJ, Park CH, Han MR, Lee S, Ohn JH, Kim J, Kim J, Kim JH. ArrayXPath II: mapping and visualizing microarray gene-expression data with biomedical ontologies and integrated biological pathway resources using Scalable Vector Graphics. Nucleic Acids Res. 2005;33:W621–W626. [PubMed] 5. Dahlquist KD, Salomonis N, Vranizan K, Lawlor SC, Conklin BR. GenMAPP, a new tool for viewing and analyzing microarray data on biological pathways. Nat. Genet. 2002;31:19–20. [PubMed] 6. Demir E, Babur O, Dogrusoz U, Gursoy A, Nisanci G, Cetin-Atalay R, Ozturk M. PATIKA: an integrated visual environment for collaborative construction and analysis of cellular pathways. Bioinformatics. 2002;18:996–1003. [PubMed] 7. Mlecnik B, Scheideler M, Hackl H, Hartler J, Sanchez-Cabo F, Trajanoski Z. PathwayExplorer: web service for visualizing high-throughput expression data on biological pathways. Nucleic Acids Res. 2005;33:W633–W637. [PubMed] 8. Ng A, Bursteinas B, Gao Q, Mollison E, Zvelebil M. pSTIING: a ‘systems’ approach towards integrating signalling pathways, interaction and transcriptional regulatory networks in inflammation and cancer. Nucleic Acids Res. 2006;34:D527–D534. [PubMed] 9. Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D, Amin N, Schwikowski B, Ideker T. Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 2003;13:2498–2504. [PubMed] 10. Fukuda K, Takagi T. Knowledge representation of signal transduction pathways. Bioinformatics. 2001;17:829–837. [PubMed] 11. Demir E, Babur O, Dogrusoz U, Gursoy A, Ayaz A, Gulesir G, Nisanci G, Cetin-Atalay R. An ontology for collaborative construction and analysis of cellular pathways. Bioinformatics. 2004;20:349–356. [PubMed] 12. Herman I, MelancËon G, Scott Marshall M. Graph visualization and navigation in information visualization: a Survey. IEEE Trans.Vis. Comput. Graph. 2000;6:24–43. 13. Gavin AC, Bosche M, Krause R, Grandi P, Marzioch M, Bauer A, Schultz J, Rick JM, Michon AM, et al. Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature. 2002;415:141–147. [PubMed] 14. Spirin V, Mirny LA. Protein complexes and functional modules in molecular networks. Proc. Natl Acad. Sci. USA. 2003;100:12123–12128. [PubMed] 15. Sugiyama K, Misue K. Visualization of structure information: automatic drawing of compound digraphs. IEEE Trans. Syst. Man Cybern. 1991;21:876–892. 16. Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabasi AL. Hierarchical organization of modularity in metabolic networks. Science. 2002;297:1551–1555. [PubMed] 17. Gagneur J, Krause R, Bouwmeester T, Casari G. Modular decomposition of protein-protein interaction networks. Genome Biol. 2004;5:R57. [PubMed] 18. Klukas C, Schreiber F. Dynamic exploration and editing of KEGG pathway diagrams. Bioinformatics. 2007;23:344–350. [PubMed] 19. Saraiya P, North C, Duca K. Visualizing biological pathways: requirements analysis, systems evaluation and research agenda. Information Visualization. 2005;4:191–205. 20. Hu Z, Mellor J, Wu J, Yamada T, Holloway D, Delisi C. VisANT: data-integrating visual framework for biological networks and modules. Nucleic Acids Res. 2005;33:W352–W357. [PubMed] 21. Kitano H, Funahashi A, Matsuoka Y, Oda K. Using process diagrams for the graphical representation of biological networks. Nat. Biotechnol. 2005;23:961–966. [PubMed] 22. Stuart JM, Segal E, Koller D, Kim SK. A gene-coexpression network for global discovery of conserved genetic modules. Science. 2003;302:249–255. [PubMed] 23. DeRisi JL, Iyer VR, Brown PO. Exploring the metabolic and genetic control of gene expression on a genomic scale. Science. 1997;278:680–686. [PubMed] 24. Lashkari DA, DeRisi JL, McCusker JH, Namath AF, Gentile C, Hwang SY, Brown PO, Davis RW. Yeast microarrays for genome wide parallel genetic and gene expression analysis. Proc. Natl Acad. Sci. USA. 1997;94:13057–13062. [PubMed] 25. Segal E, Wang H, Koller D. Discovering molecular pathways from protein interaction and gene expression data. Bioinformatics. 2003;19(Suppl. 1):i264–i271. [PubMed] 26. Junker BH, Klukas C, Schreiber F. VANTED: a system for advanced data analysis and visualization in the context of biological networks. BMC Bioinformatics. 2006;7:109. [PubMed] 27. Ball CA, Awad IA, Demeter J, Gollub J, Hebert JM, Hernandez-Boussard T, Jin H, Matese JC, Nitzberg M, et al. The Stanford Microarray Database accommodates additional microarray platforms and data formats. Nucleic Acids Res. 2005;33:D580–D582. [PubMed] 28. Barrett T, Troup DB, Wilhite SE, Ledoux P, Rudnev D, Evangelista C, Kim IF, Soboleva A, Tomashevsky M, et al. NCBI GEO: mining tens of millions of expression profiles – database and tools update. Nucleic Acids Res. 2007;35:D760–D765. [PubMed] 29. Owen AB, Stuart J, Mach K, Villeneuve AM, Kim S. A gene recommender algorithm to identify coexpressed genes in C. elegans. Genome Res. 2003;13:1828–1837. [PubMed] 30. Ng DM, Woehrmann MH, Stuart JM. Recommending pathway genes using a compendium of clustering solutions. Pac. Symp. Biocomput. 2007;12:379–390. 31. Hu Z, Mellor J, Wu J, DeLisi C. VisANT: an online visualization and analysis tool for biological interaction data. BMC Bioinformatics. 2004;5:17. [PubMed] 32. Hu Z, Mellor J, DeLisi C. In: Current Protocols in Bioinformatics. Baxevanis A, Davison D, Page R, Petsko G, Stein L, Stormo G, editors. New Jersey, USA: John Wiley & Sons, Inc; 2004. 33. Mellor JC, Yanai I, Clodfelter KH, Mintseris J, DeLisi C. Predictome: a database of putative functional links between proteins. Nucleic Acids Res. 2002;30:306–309. [PubMed] 34. Ge H, Liu Z, Church GM, Vidal M. Correlation between transcriptome and interactome mapping data from Saccharomyces cerevisiae. Nat. Genet. 2001;29:482–486. [PubMed] 35. Jansen R, Greenbaum D, Gerstein M. Relating whole-genome expression data with protein-protein interactions. Genome Res. 2002;12:37–46. [PubMed] 36. Hasegawa H, Sanjo N, Chen F, Gu YJ, Shier C, Petit A, Kawarai T, Katayama T, Schmidt SD, et al. Both the sequence and length of the C terminus of PEN-2 are critical for intermolecular interactions and function of presenilin complexes. J. Biol. Chem. 2004;279:46455–46463. [PubMed] |
PubMed related articles
Your browsing activity is empty. Activity recording is turned off. |
|||||||||
Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D354-7.
[Nucleic Acids Res. 2006]Nucleic Acids Res. 2005 Jan 1; 33(Database issue):D428-32.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2005 Jan 1; 33(Database issue):D334-7.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W621-6.
[Nucleic Acids Res. 2005]Nat Genet. 2002 May; 31(1):19-20.
[Nat Genet. 2002]Bioinformatics. 2002 Jul; 18(7):996-1003.
[Bioinformatics. 2002]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W633-7.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D527-34.
[Nucleic Acids Res. 2006]Bioinformatics. 2002 Jul; 18(7):996-1003.
[Bioinformatics. 2002]Bioinformatics. 2001 Sep; 17(9):829-37.
[Bioinformatics. 2001]Bioinformatics. 2004 Feb 12; 20(3):349-56.
[Bioinformatics. 2004]Nature. 2002 Jan 10; 415(6868):141-7.
[Nature. 2002]Proc Natl Acad Sci U S A. 2003 Oct 14; 100(21):12123-8.
[Proc Natl Acad Sci U S A. 2003]Nat Biotechnol. 2005 Aug; 23(8):961-6.
[Nat Biotechnol. 2005]Science. 2003 Oct 10; 302(5643):249-55.
[Science. 2003]Science. 1997 Oct 24; 278(5338):680-6.
[Science. 1997]Proc Natl Acad Sci U S A. 1997 Nov 25; 94(24):13057-62.
[Proc Natl Acad Sci U S A. 1997]Bioinformatics. 2003; 19 Suppl 1():i264-71.
[Bioinformatics. 2003]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W621-6.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W352-7.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2005 Jan 1; 33(Database issue):D580-2.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2007 Jan; 35(Database issue):D760-5.
[Nucleic Acids Res. 2007]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W352-7.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W352-7.
[Nucleic Acids Res. 2005]Genome Res. 2003 Aug; 13(8):1828-37.
[Genome Res. 2003]Nucleic Acids Res. 2005 Jul 1; 33(Web Server issue):W352-7.
[Nucleic Acids Res. 2005]BMC Bioinformatics. 2004 Feb 19; 5():17.
[BMC Bioinformatics. 2004]J Biol Chem. 2004 Nov 5; 279(45):46455-63.
[J Biol Chem. 2004]J Biol Chem. 2004 Nov 5; 279(45):46455-63.
[J Biol Chem. 2004]Nucleic Acids Res. 2002 Jan 1; 30(1):306-9.
[Nucleic Acids Res. 2002]Bioinformatics. 2003; 19 Suppl 1():i264-71.
[Bioinformatics. 2003]Nat Genet. 2001 Dec; 29(4):482-6.
[Nat Genet. 2001]Genome Res. 2002 Jan; 12(1):37-46.
[Genome Res. 2002]J Biol Chem. 2004 Nov 5; 279(45):46455-63.
[J Biol Chem. 2004]Nucleic Acids Res. 2005 Jan 1; 33(Database issue):D428-32.
[Nucleic Acids Res. 2005]Nucleic Acids Res. 2005 Jan 1; 33(Database issue):D334-7.
[Nucleic Acids Res. 2005]