![]() | ![]() |
Formats:
|
||||||||||||
Copyright © 2009 The Author(s) DASMI: exchanging, annotating and assessing molecular interaction data 1Max Planck Institute for Informatics, Campus E 1.4, 66123 Saarbrücken, Germany, 2Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SA and 3European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SD, UK *To whom correspondence should be addressed. Associate Editor: Jonathan D. Wren Received August 14, 2008; Revised January 27, 2009; Accepted March 9, 2009. 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 Motivation: Ever increasing amounts of biological interaction data are being accumulated worldwide, but they are currently not readily accessible to the biologist at a single site. New techniques are required for retrieving, sharing and presenting data spread over the Internet. Results: We introduce the DASMI system for the dynamic exchange, annotation and assessment of molecular interaction data. DASMI is based on the widely used Distributed Annotation System (DAS) and consists of a data exchange specification, web servers for providing the interaction data and clients for data integration and visualization. The decentralized architecture of DASMI affords the online retrieval of the most recent data from distributed sources and databases. DASMI can also be extended easily by adding new data sources and clients. We describe all DASMI components and demonstrate their use for protein and domain interactions. Availability: The DASMI tools are available at http://www.dasmi.de/ and http://ipfam.sanger.ac.uk/graph. The DAS registry and the DAS 1.53E specification is found at http://www.dasregistry.org/. Contact: mario.albrecht/at/mpi-inf.mpg.de Supplementary information: Supplementary data and all figures in color are available at Bioinformatics online. 1 INTRODUCTION Molecular interactions are of fundamental importance to many biological processes (BPs). In recent years, the amount of interaction data has increased substantially due to growing attention by the scientific community as well as the widespread use of high-throughput techniques that afford screening of vast numbers of molecules. Nowadays, large-scale protein interaction maps are available for model organisms like yeast, fly and worm (Goll and Uetz, 2007), and the current research focus is shifting towards interaction screens for human (Cusick et al., 2005; Stelzl and Wanker, 2006). In addition, computational methods have been developed for predicting molecular interactions, some of which reach prediction quality comparable to that of experimental high-throughput data (Ramírez et al., 2007; Shoemaker and Panchenko, 2007). However, this rapid accumulation of interaction data makes it difficult for scientists to keep track of all available information and data sources. The unification of heterogeneous and decentralized interaction data is thus a prerequisite for an effective study of interactomes (Brazma et al., 2006). Molecular interactions can be studied at different levels of detail (Fig. 1
A number of databases keep track of experimentally determined protein interactions (Bader et al., 2003; Breitkreutz et al., 2008; Chatr-Aryamontri et al., 2007; Güldener et al., 2006; Kerrien et al., 2007a; Keshava Prasad et al., 2009; Salwinski et al., 2004). Such databases are essential components of interactomics, however, each of them contains information not found in other databases (Mathivanan et al., 2006). The IMEx consortium formed by eight major interaction data providers aims at overcoming the fragmentation by sharing the curation effort and exchanging curated protein interaction records among its members (Orchard et al., 2007). However, IMEx and its member databases are restricted to experimentally determined protein interactions, which cover only a fraction of the estimated interactomes (Stumpf et al., 2008). Voluminous data on predicted protein and domain interactions that have been made publicly available by different research groups (Schelhorn et al., 2008; Schlicker et al., 2007; Shoemaker and Panchenko, 2007) are not included. To provide broader data access to currently available interactomes, several integration frameworks have appeared recently. We will refer to the methodology underlying these frameworks as static data integration because either the user is assisted in building a local data warehouse (Aragues et al., 2006; Lee et al., 2006b; Shah et al., 2005; Shannon et al., 2006) or the software facilitates access to central data repositories via web interfaces (Birkland and Yona, 2006; Breitkreutz et al., 2008; Cerami et al., 2006; Chaurasia et al., 2009; Goll et al., 2008; Hoffmann and Valencia, 2004; Jensen et al., 2009; Pagel et al., 2008; Prieto and Rivas, 2006; Raghavachari et al., 2008; Tarcea et al., 2009) or by software plugins, for instance, as available for Cytoscape (Avila-Campillo et al., 2007; Cerami et al., 2006; Hernandez-Toro et al., 2007; Shannon et al., 2003; Tarcea et al., 2009). However, static integration has the drawback of providing only a snapshot of a fixed number of data sources at a certain point of time. Once the data have been included into the central repository, curation efforts are required to keep them up to date and in sync with the original data source. This permanent update problem can be aggravated by possible format changes of the source, which hampers further data processing. Apart from that, these integration frameworks are rather rigid because the inclusion of additional datasets like new experimental data or the results of a novel prediction method can normally be accomplished solely by the central authority. A data fragmentation situation similar to the current diversity of interaction data arose with genomic data several years ago. One possible solution to the integration of genomic data and their annotations was the Distributed Annotation System (DAS) (Dowell et al., 2001). In general, it is anticipated that decentralization will become an important data-sharing concept in the future (Murray-Rust, 2008; Stein, 2008; Thorisson et al., 2009). DAS is based on a client–server architecture in which numerous decentralized servers offer annotations of a reference entity provided by another server. The combination and visualization of a reference entity and its annotations is performed in a DAS client. We aim to overcome the shortcomings of the aforementioned static data integration frameworks by adopting and extending a DAS-based approach for the exchange of molecular interaction data and their annotations. Instead of unifying all available interaction data into a central database, the interaction data remain with their original providers and are retrieved and integrated online on request. This eliminates the issue of centralized data maintenance and ensures that the interaction data are always kept up to date. Our system, named DAS for Molecular Interactions (DASMI), is sufficiently generic to support all types of interaction data described above. It is not restricted to protein interactions and considers both experimentally determined and predicted interactions. This is the main distinguishing feature from interaction repositories like HPRD (Keshava Prasad et al., 2009) or IntAct (Kerrien et al., 2007a). Instead of competing with them, we want to supplement their data with additional sources and help the user to assess the available information. In the following section, we will introduce the distributed architecture of DASMI and describe its components: the specification of a DAS extension for the exchange of interaction data and their annotations as well as the software libraries that implement the new specification in servers and clients. Finally, we will demonstrate the exemplary use of DASMI for protein and domain interactions. 2 METHODS 2.1 Distributed architecture DAS (Dowell et al., 2001) is a data integration approach with the main goal of replacing central data repositories with distributed storage systems. DAS is built on a client–server architecture, consisting of two types of servers, namely, reference and annotation servers, and a client for visualization purposes. Reference servers provide the biological reference entity, for example, a nucleotide or peptide sequence. Annotation servers make additional information available that is related to the reference sequence, for instance, information on exons or protein domains. Coordinate systems are used to define the entities that a DAS server provides or annotates, for example, chromosomes, genes, protein sequences or protein structures (Prlić et al., 2007). A data exchange specification handles the communication between DAS clients and DAS servers by prevalent techniques, namely HTTP URL requests and XML responses. Originally, DAS was designed for the exchange of annotations of DNA sequences. In recent years, several extensions to the protocol have widened its use to other areas (Jenkinson et al., 2008): Protein DAS affords the exchange of protein sequence annotations and alignments (Jones et al., 2005), 3D-DAS utilizes DAS for the annotation of protein structure alignments (Prlić et al., 2005) and 3D-EM DAS for electron microscopy (Macías et al., 2007). In addition to these DAS extensions, a registry has been developed that maintains a list of available DAS servers and thus allows DAS clients finding suitable servers (http://www.dasregistry.org/). DASMI aims at resolving the problems of current integration frameworks for interaction data by transferring the idea of DAS into the field of molecular interactions. This includes the specification of a DAS extension defining the data exchange between servers and clients as well as reference implementations of servers and clients (Fig. 2
As in the original DAS architecture, there are different server types in the DASMI framework. The majority of servers provide interaction data and optionally additional information; these are the equivalents of DAS reference servers. Examples of additional information, which can be associated specifically with an interaction, include the known or predicted interaction regions, the strength and type of the interaction, or the conditions in which the interaction occurs. Confidence servers are comparable with DAS annotation servers and provide reliability scores for potential interactions. Notably, the HUPO-PSI community wants to utilize our distributed scoring architecture for a common confidence scoring system for protein–protein interactions (Orchard et al., 2008). Each interaction or confidence server belongs to a certain coordinate or identifier system, which specifies how interactions can be requested and how they are returned. For instance, a data source with the Entrez Gene identifier system may be queried for interactions by using gene identifiers, another data source with the UniProtKB identifier system by using protein identifiers. DASMI clients thus need to transform the results of servers from different identifier systems in order to unify them. 2.2 DASMI data exchange specification Data exchange between interaction servers and clients requires a DAS URL and XML specification. An advantage of a well-defined data exchange specification is the resulting modularity and extensibility of the system. New servers and clients can be readily incorporated if they follow the specification and thus communicate with the existing parts in a well-defined manner. We extend the DAS specification by the new interaction command and the associated DASINT XML response format. This extension is part of the DAS 1.53E specification (Jenkinson et al., 2008). Figure 3
Requests to a DASMI server are issued in the same form of a formatted URL request as those to a standard DAS server (Fig. 3 The response of a DASMI server to an interaction request is a DASINT XML document (Fig. 3 2.3 DASMI server A DASMI server responds to an interaction request by providing interaction data in the DASINT XML format defined above. One of the objectives of DAS and thus of DASMI is to make the setup of DAS servers easy. To achieve this aim, three versatile open-source DAS server libraries are available, Dazzle (http://www.biojava.org/wiki/Dazzle) and MyDas (http://code.google.com/p/mydas/) for Java, and ProServer (Finn et al., 2007) for Perl (http://www.sanger.ac.uk/Software/analysis/proserver/). We provide DASMI reference server implementations by extending Dazzle and ProServer, while MyDAS is being extended by the DAS community. The stand-alone servers Dazzle and ProServer both work in a modular fashion. They consist of a server core, which provides basic functionalities like handling requests and responses, and components, which manage specific DAS commands and data storage formats. Existing DataSource classes (Dazzle) and Transport modules (ProServer) act as brokers between the underlying interaction data and the modules that build the DASINT XML response. This simplifies access to a range of data storage formats, for instance, PSI-MI XML2.5 documents (Kerrien et al., 2007a) or flat files in the Simple Interaction Format (SIF) defined for Cytoscape (Cline et al., 2007; Shannon et al., 2003). In order to set up a new server, data providers need only to use an existing or implement a new module that is tailored to the specifics of their molecular interaction data. 2.4 Interaction datasets DASMI has been developed to support molecular interactions at different levels (Fig. 1 Of course, our current selection of data sources, with the majority of them temporarily maintained at our institute, serves only as a prototype for the capabilities of our system because it necessitates the replication of some interaction datasets, resulting in the same update problem the aforementioned central repositories are facing. However, for the near future, we already know from other scientists that new sources for interactions and confidence measures will be made available at other institutions. 2.5 DASMI client A DASMI client offers the user an easy way of communicating with various DASMI servers without having to know any data exchange specification details. Subsequent to a user request, a DASMI client will contact all DASMI servers, retrieve and unify the interaction data and present the results to the user. A list of all publicly available DASMI servers is provided by the DAS registry (Prlić et al., 2007). To facilitate the development of new DASMI clients, the two existing open-source DAS client libraries, Dasobert (http://www.spice-3d.org/dasobert/) in Java and Bio-Das-Lite (http://search.cpan.org/dist/Bio-Das-Lite/) in Perl, have been upgraded to support our interaction extension. 2.5.1 Identifier mapping Proteomics affords a substantial diversity of object identifiers, ranging from RefSeq and Entrez Gene identifiers to UniProtKB accession numbers. Accordingly, protein interaction datasets use different identifier systems to describe their interactions. In order to unify them, a DASMI client has to convert between various systems to incorporate servers that have different identifier systems. This mapping procedure can produce considerable computational overhead. For instance, while there is usually a one-to-one mapping from UniProtKB to Entrez Gene identifiers, mapping in the opposite direction may produce multiple results as one gene can be responsible for several protein variants or fragments. Therefore, a DASMI client might need to issue multiple queries to retrieve all protein–protein interactions for one gene. Furthermore, the mapping procedure implemented by a DASMI client determines if it is able to distinguish splice variants. In contrast, the identifier diversity for domain interaction datasets is less problematic as stable Pfam identifiers (Finn et al., 2008) are predominantly used. 3 RESULTS On the basis of the client libraries Dasobert and Bio-Das-Lite, two DASMI clients have been developed to illustrate the potential of our new system: the DASMIweb client as an entry gate to various protein–protein and domain–domain interaction datasets and the iPfam graphical domain interaction browser that uses DASMI to incorporate predicted domain–domain interactions into its results. 3.1 DASMIweb for protein and domain interactions The DASMI client DASMIweb is publicly accessible at http://www.dasmi.de/web/. The aim of DASMIweb is to establish a starting point for interactome studies by consolidating protein and domain interaction data from various sources. 3.1.1 User interface The DASMIweb user interface is designed to be clear and intuitive (Fig. 4
3.1.2 Querying To make querying DASMIweb as intuitive as possible, the Query Panel contains only a single search field. There is no need for the user to specify the type of the query. The system will use internal identifier mapping tables derived from iProClass (Huang et al., 2003) and Pfam (Finn et al., 2008) to automatically determine whether the input is a gene, protein or domain identifier. If the identifier cannot be mapped unambiguously, the user is asked to refine the query. Furthermore, DASMIweb will map the query to all compatible identifier systems in order to maximize the number of data sources that can be used to answer the user query. For instance, if the user searches by an Entrez Gene identifier, DASMIweb will not only query all data sources in the Entrez Gene identifier system, but will also try to convert the identifier to UniProtKB, GeneInfo, RefSeq and Ensembl identifiers to cover all data sources in the respective identifier systems. If a mapping results in multiple identifiers, for instance, when mapping from gene to protein identifiers, all combinations of identifiers are used. A more detailed description of the mapping procedure and exemplary mappings can be found in the online documentation at http://www.dasmi.de/. 3.1.3 Presentation of results Interactions are presented to the user in tabular form within the Interaction Panel. In the central table, columns represent data sources that have been contacted for the user query, rows correspond to different interactions, and squares in the intersections of rows and columns indicate particular interactions reported by a specific source (Fig. 4 The user can also request further information about an interaction, such as experimental details and confidence scores, by clicking on the associated ‘interaction square’. These annotation details are an optional feature provided by the individual data sources. Therefore, they might not be available for all interactions. 3.1.4 Source configuration and data export In its initial configuration, DASMIweb incorporates all available data sources that are compatible with a user query. The user can change this selection in the Source Configuration Panel. This panel lists all known data sources that are registered in the DAS registry with their identifier systems. The user can integrate additional data sources that are not contained in the DAS registry by using the ‘Add new source’ tab of the Source Configuration. After providing all required information like the name, URL and identifier system of the new source, it will be included in all future queries. Another way of adding new interaction data is by creating a DASMI server from an existing PSI-MI XML2.5 file. After uploading the file into DASMIweb, the interactions will be made temporarily available as a new DASMI server. This procedure enables users to compare their own interactions with existing datasets or to assess them by confidence servers. In order to analyze the results with external applications such as the network visualization software Cytoscape (Shannon et al., 2003), the user can export the results from the web client into file formats like the PSI-MI tabular format MITAB2.5 (Kerrien et al., 2007b) or the SIF (Cline et al., 2007). 3.1.5 Quality assessment Current protein interaction networks are still incomplete to a large extent and are prone to bias and errors (Ramírez et al., 2007). To address this problem, DASMIweb offers useful options to assess the reliability of individual interactions. The following datasets of confidence scores can be requested and selected in the header of the Interaction Panel and are applied to color the interaction squares:
3.2 iPfam graphical domain interaction browser iPfam (Finn et al., 2005) is a database of Pfam domain interactions derived from proteins with an experimentally determined 3D structure. Integrating information about domain interactions from various sources enables one to address several questions. For instance, datasets generated using different methods can be compared and structurally known domain interactions provided by iPfam or 3did (Stein et al., 2009) can be used to verify predicted domain interactions. To this end, the iPfam database has developed a client tool that graphically integrates domain interaction information from one or more DASMI servers (http://ipfam.sanger.ac.uk/graph) including an own server for structural interactions. For a user-selected domain, the iPfam tool retrieves data about interacting domains and represents them as a graph. Each domain is depicted as an oval node within the graph, and interactions are represented by graph edges. Different colors are used to distinguish interactions from individual data sources. Clicking on a domain will center the graph on the interactions for that domain, which supports the visual exploration of the domain interaction network. 3.3 Comparison with existing interaction repositories DASMI clients may be compared with interaction databases like HPRD (Keshava Prasad et al., 2009) or IntAct (Kerrien et al., 2007a). However, DASMI does not want to compete with such databases, but intends to complement their results with interaction data from other datasets. For example, the results of computational predictions as available in Bioverse (McDermott et al., 2005) are not included into databases of experimental protein interactions, though they might give scientists new insights into the function of proteins (Sharan et al., 2007). Providing more interaction datasets is not only a goal of DASMI, but also the motivation for composite databases like MiMI (Tarcea et al., 2009) for protein–protein interaction or DOMINE for domain–domain interactions (Raghavachari et al., 2008). In contrast to DASMI, these composite databases combine several datasets into a central repository, which renders it difficult to ensure that the interaction data they provide is kept in sync with the original sources. IntAct, for instance, has a daily release cycle, implying daily update processes of the composite databases. DASMI avoids this problem by leaving the interaction data with its original providers. In addition, DASMI fosters the inclusion of novel interaction data and interaction confidence scoring methods. There is no central authority that decides which data resources are included and which are not. By setting up a new DASMI server and registering it at the DAS registry, the interaction data or confidence scoring routine will automatically be available to all users (Fig. 2 4 DISCUSSION AND CONCLUSION We have introduced DASMI, a new framework for the dynamic exchange and integration of different types of interaction data. The DAS protocol extension DASMI is based on a client–server architecture and comprises three main components: data exchange specification, interaction servers and integration clients. Open source server and client libraries are available for the programming languages Java and Perl. Due to its distributed architecture, DASMI is easily extensible, for instance, by including new servers or developing additional clients. By avoiding a central interaction data repository, DASMI bypasses the problem of update cycles that static integration frameworks face. As a prototypic application, we set up several DASMI servers and developed web clients for the exchange of protein and domain interactions. The client DASMIweb dynamically gathers interactions from various servers and integrates their results into a unified view. In addition, the reliability of interactions can be assessed by confidence measures. Furthermore, DASMI is used by an iPfam client to integrate predicted domain–domain interactions into iPfam results. The development of DASMI will be continued and further extensions will be included. Future plans include more DASMI sources for interaction datasets and confidence measures by external providers. Additional proxies will allow incorporating servers into the DASMI system that do not use DASINT but PSI-MI XML2.5 or other XML formats. The DASMI clients DASMIweb and iPfam will be equipped with new features like a graphical network representation for DASMIweb. Additionally, new DASMI clients like a Cytoscape plugin are under development. [Supplementary Data]
ACKNOWLEDGEMENTS The work was conducted in the context of the DFG-funded Cluster of Excellence for Multimodal Computing and Interaction and the EC-funded BioSapiens Network of Excellence. Funding: German National Genome Research Network (NGFN); German Research Foundation (DFG contract number KFO 129/1-2); European Commission (LSHG-CT-2003-503265). Conflict of Interest: none declared. REFERENCES
|
PubMed related articles
Your browsing activity is empty. Activity recording is turned off. |
|||||||||||
Hum Mol Genet. 2005 Oct 15; 14 Spec No. 2():R171-81.
[Hum Mol Genet. 2005]Curr Opin Chem Biol. 2006 Dec; 10(6):551-8.
[Curr Opin Chem Biol. 2006]Proteomics. 2007 Aug; 7(15):2541-52.
[Proteomics. 2007]PLoS Comput Biol. 2007 Apr 27; 3(4):e43.
[PLoS Comput Biol. 2007]Nat Rev Genet. 2006 Aug; 7(8):593-605.
[Nat Rev Genet. 2006]Nat Rev Genet. 2006 Feb; 7(2):119-29.
[Nat Rev Genet. 2006]Nucleic Acids Res. 2008 Jan; 36(Database issue):D281-8.
[Nucleic Acids Res. 2008]Nat Rev Mol Cell Biol. 2006 Mar; 7(3):188-97.
[Nat Rev Mol Cell Biol. 2006]Bioinformatics. 2005 Feb 1; 21(3):410-2.
[Bioinformatics. 2005]Nucleic Acids Res. 2003 Jan 1; 31(1):248-50.
[Nucleic Acids Res. 2003]Nucleic Acids Res. 2008 Jan; 36(Database issue):D637-40.
[Nucleic Acids Res. 2008]Nucleic Acids Res. 2007 Jan; 35(Database issue):D572-4.
[Nucleic Acids Res. 2007]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D436-41.
[Nucleic Acids Res. 2006]Nucleic Acids Res. 2007 Jan; 35(Database issue):D561-5.
[Nucleic Acids Res. 2007]Bioinformatics. 2006 Apr 15; 22(8):1015-7.
[Bioinformatics. 2006]BMC Bioinformatics. 2006 Mar 23; 7():170.
[BMC Bioinformatics. 2006]BMC Bioinformatics. 2005 Feb 21; 6():34.
[BMC Bioinformatics. 2005]BMC Bioinformatics. 2006 Mar 28; 7():176.
[BMC Bioinformatics. 2006]BMC Bioinformatics. 2006 Feb 15; 7():70.
[BMC Bioinformatics. 2006]BMC Bioinformatics. 2001; 2():7.
[BMC Bioinformatics. 2001]Nature. 2008 Feb 7; 451(7179):648-51.
[Nature. 2008]Nat Rev Genet. 2008 Sep; 9(9):678-88.
[Nat Rev Genet. 2008]Nat Rev Genet. 2009 Jan; 10(1):9-18.
[Nat Rev Genet. 2009]Nucleic Acids Res. 2009 Jan; 37(Database issue):D767-72.
[Nucleic Acids Res. 2009]Nucleic Acids Res. 2007 Jan; 35(Database issue):D561-5.
[Nucleic Acids Res. 2007]BMC Bioinformatics. 2001; 2():7.
[BMC Bioinformatics. 2001]BMC Bioinformatics. 2007 Sep 12; 8():333.
[BMC Bioinformatics. 2007]BMC Bioinformatics. 2008 Jul 22; 9 Suppl 8():S3.
[BMC Bioinformatics. 2008]Bioinformatics. 2005 Jul 15; 21(14):3198-9.
[Bioinformatics. 2005]Bioinformatics. 2005 Sep 1; 21 Suppl 2():ii40-1.
[Bioinformatics. 2005]J Struct Biol. 2007 May; 158(2):205-13.
[J Struct Biol. 2007]BMC Bioinformatics. 2001; 2():7.
[BMC Bioinformatics. 2001]BMC Bioinformatics. 2001; 2():7.
[BMC Bioinformatics. 2001]Proteomics. 2008 Oct; 8(20):4168-72.
[Proteomics. 2008]BMC Bioinformatics. 2008 Jul 22; 9 Suppl 8():S3.
[BMC Bioinformatics. 2008]BMC Biol. 2007 Oct 9; 5():44.
[BMC Biol. 2007]Bioinformatics. 2007 Jun 15; 23(12):1568-70.
[Bioinformatics. 2007]Nucleic Acids Res. 2007 Jan; 35(Database issue):D561-5.
[Nucleic Acids Res. 2007]Nat Protoc. 2007; 2(10):2366-82.
[Nat Protoc. 2007]Genome Res. 2003 Nov; 13(11):2498-504.
[Genome Res. 2003]Nature. 2005 Oct 20; 437(7062):1173-8.
[Nature. 2005]Cell. 2005 Sep 23; 122(6):957-68.
[Cell. 2005]Nucleic Acids Res. 2004 Jan 1; 32(Database issue):D449-51.
[Nucleic Acids Res. 2004]Nucleic Acids Res. 2009 Jan; 37(Database issue):D767-72.
[Nucleic Acids Res. 2009]Nucleic Acids Res. 2007 Jan; 35(Database issue):D561-5.
[Nucleic Acids Res. 2007]BMC Bioinformatics. 2007 Sep 12; 8():333.
[BMC Bioinformatics. 2007]Nucleic Acids Res. 2008 Jan; 36(Database issue):D281-8.
[Nucleic Acids Res. 2008]Bioinformatics. 2008 Sep 15; 24(18):2119-21.
[Bioinformatics. 2008]Mol Syst Biol. 2008; 4():201.
[Mol Syst Biol. 2008]Nucleic Acids Res. 2003 Jan 1; 31(1):390-2.
[Nucleic Acids Res. 2003]Nucleic Acids Res. 2008 Jan; 36(Database issue):D281-8.
[Nucleic Acids Res. 2008]Genome Res. 2003 Nov; 13(11):2498-504.
[Genome Res. 2003]BMC Biol. 2007 Oct 9; 5():44.
[BMC Biol. 2007]Nat Protoc. 2007; 2(10):2366-82.
[Nat Protoc. 2007]Proteomics. 2007 Aug; 7(15):2541-52.
[Proteomics. 2007]Nucleic Acids Res. 2008 Jan; 36(Database issue):D434-9.
[Nucleic Acids Res. 2008]BMC Bioinformatics. 2006 Jun 15; 7():302.
[BMC Bioinformatics. 2006]Nucleic Acids Res. 2008 Jan; 36(Database issue):D434-9.
[Nucleic Acids Res. 2008]BMC Bioinformatics. 2006 Jun 15; 7():302.
[BMC Bioinformatics. 2006]Bioinformatics. 2005 Feb 1; 21(3):410-2.
[Bioinformatics. 2005]Nucleic Acids Res. 2009 Jan; 37(Database issue):D300-4.
[Nucleic Acids Res. 2009]Nucleic Acids Res. 2009 Jan; 37(Database issue):D767-72.
[Nucleic Acids Res. 2009]Nucleic Acids Res. 2007 Jan; 35(Database issue):D561-5.
[Nucleic Acids Res. 2007]Bioinformatics. 2005 Aug 1; 21(15):3217-26.
[Bioinformatics. 2005]Mol Syst Biol. 2007; 3():88.
[Mol Syst Biol. 2007]Nucleic Acids Res. 2009 Jan; 37(Database issue):D642-6.
[Nucleic Acids Res. 2009]Nucleic Acids Res. 2008 Jan; 36(Database issue):D656-61.
[Nucleic Acids Res. 2008]