![]() | ![]() |
Formats:
|
||||||||||||||
Copyright © 2006 The Author(s) CellCircuits: a database of protein network models Department of Bioengineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92037, USA 1Division of Biology, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92037, USA *To whom correspondence should be addressed. Tel: +1 858 822 4558; Fax: +1 858 822 4246; Email: trey/at/bioeng.ucsd.edu The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors Received August 16, 2006; Revised October 11, 2006; Accepted October 13, 2006. 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 CellCircuits (http://www.cellcircuits.org) is an open-access database of molecular network models, designed to bridge the gap between databases of individual pairwise molecular interactions and databases of validated pathways. CellCircuits captures the output from an increasing number of approaches that screen molecular interaction networks to identify functional subnetworks, based on their correspondence with expression or phenotypic data, their internal structure or their conservation across species. This initial release catalogs 2019 computationally derived models drawn from 11 journal articles and spanning five organisms (yeast, worm, fly, Plasmodium falciparum and human). Models are available either as images or in machine-readable formats and can be queried by the names of proteins they contain or by their enriched biological functions. We envision CellCircuits as a clearinghouse in which theorists may distribute or revise models in need of validation and experimentalists may search for models or specific hypotheses relevant to their interests. We demonstrate how such a repository of network models is a novel systems biology resource by performing several meta-analyses not currently possible with existing databases. INTRODUCTION At present, a great deal of biological information is represented as interactions between molecules. This information includes physical interactions that occur among proteins, DNA, RNA and small molecules (1–3); genetic interactions such as synthetic lethality, enhancement or suppression (4); and interactions due to co-expression (5) or co-citation (6). Modern analyses of interaction data typically accomplish two goals. The first goal is to clean the data, by filtering erroneous interactions that can be associated with high-throughput screens [false positives, e.g. (7,8)] or by predicting new interactions that may have been previously missed [false negatives, e.g. (9,10)]. The second goal is to organize the interactions into biological network models—i.e. collections of interactions hypothesized to work together towards a particular cellular function or within a common pathway (11–13). Interaction analysis is currently supported by two types of available databases (Figure 1
Automatic inference of accurate and detailed molecular pathways, however, is well beyond the capability of current interaction analyses and integrative modeling approaches. Although current approaches attempt to place interactions into subnetworks according to their putative function (11–13), such subnetworks are hypothetical in nature and thus inappropriate for entry into any of the existing databases of canonical pathways. Rather, the subnetwork models produced by automated approaches are typically embedded in figures, tables or supplementary information in the primary published literature. Although it is certainly possible to read about the models, there are several problems with this traditional method of dissemination. First, the size and number of models from even a single publication can be overwhelming, making models relevant to a particular gene or function difficult to locate. Second, in many cases, network modeling papers target bioinformatic, rather than biological or medical, audiences. As a result, the models remain largely inaccessible to those who have the most knowledge to interpret them and the most to gain from their successful interpretation. Recent opinion articles (25,26) have recognized a related problem for the case of protein functional predictions, calling for a clearinghouse of hypotheses generated by bioinformatics analyses and searchable by experimental biologists. In the same vein, the BioModels Database (27) has recently been adopted as a working repository for simulations of kinetic quantitative systems based on ordinary differential equations. Subnetworks inferred from genome-scale data, however, do not fall into this category. Motivated by these considerations, we have designed CellCircuits as an open-access general repository of models distilled from protein networks. By aggregating models derived from many separate studies into a single resource, CellCircuits bridges the gap between databases of individual pairwise interactions and fully curated, biologically validated pathway models. The CellCircuits database enables experimentalists to readily access and cross-reference models across multiple publications. It also enables the meta-analysis of the entire set of models to reveal inter-model relationships and to answer global questions; for instance, which models overlap in terms of the genes and/or cellular processes represented? How novel is a new result given the models that are already present in the database? MATERIALS AND METHODS Data processing A data processing pipeline was used to extract information from the textual representation of a model and store that information in a MySQL (http://www.mysql.org) relational database. The data processing pipeline required a digital image of each model and a text file containing the genes, proteins, metabolites, other small molecules and interconnections represented in the model. In cases when a network model was published in graphical form only, the text file was manually transcribed (see Supplementary Table S1). To ensure that the CellCircuits database used a consistent set of gene identifiers, we mapped each gene name found in the text file for a model to a Gene Ontology (GO) gene id using tables from the GO database. Gene names found in a model but not in the GO database were automatically inserted into the appropriate database tables and flagged as being externally added. Future curation efforts could be directed towards handling these genes missing from the GO database. After models were entered into the database, they were scored using the hypergeometric test for GO annotation enrichment. Web interface We used Perl CGI scripts (http://www.perl.org) in conjunction with the Apache web server (http://httpd.apache.org), mod_perl (http://perl.apache.org) and Perl DBI (http://dbi.perl.org) to serve HTML content, handle user input and query the MySQL database. Script.aculo.us version 1.61 (http://script.aculo.us), an open source JavaScript library, was used to generate visual effects on the web pages that display search results. Scoring models for Gene Ontology annotation Using the latest release of the GO database, models were scored for a statistically significant number of genes in the model that were annotated with a particular GO term. We first identified the complete set of genes associated with each GO term. This set included the genes directly annotated with that term as well as those annotated with any of the term's descendents in the GO hierarchy. Next, we used the hypergeometric distribution (28,29) to test the genes in each model against the genes annotated with each of the GO terms. The resulting P-values were stored in the database. Scoring similarity between publications For each pair of publications we compared all models in one publication to all of the models in the other. To capture model similarity as sensitively as possible, we defined two models to be similar if they shared at least one interaction. The similarity score of a pair of publications was defined to be the number of distinct models that participated in any overlap divided by the total number of models in the pair. For example, consider publication A containing two models and publication B containing six models. If model 1 in A overlaps with models 1–5 in B, and model 2 in A only overlaps with model 1 in B, then the total number of distinct overlapping models is 7, and the similarity score between publications is 7/8. RESULTS A spectrum of network models To date, interactions have been organized by searching for essentially three types of subnetworks: linear paths of interactions, interaction clusters or parallel clusters. Representative models of each type are shown in Figure 2
Finally, integrating the interaction network with external data, such as gene expression profiles and other molecular states, has also been a key methodology used to identify significant subnetworks. For instance, these approaches have been used to find protein interaction clusters that exhibit coherent expression changes in response to panels of perturbations (33,35,36) or as a function of the cell cycle (34). Other works (42) have reported network ‘motifs’, defined as patterns of interactions that occur more often in the network than expected by chance. However, these approaches (by design) focus on general patterns rather than subnetworks of particular proteins. Therefore, they are not considered here. Database coverage and assembly This CellCircuits initial release (version 1.0) was designed as proof-of-principle of the value of a searchable database of network models. We focused on providing a clear database interface and representative, albeit incomplete, coverage of the types of network models possible. For version 1.0, the database includes models from 11 publications, spanning linear, clustered or parallel subnetworks, with priority given to publications with models available in both graphical representations and machine-readable formats (Table 1). Graphical representations of network models are a particularly valuable method of disseminating interactions and/or pathways, in much the same way that DNA sequence logos (43) are used to visualize position-specific score matrices of DNA-binding motifs. Conversely, machine-readable formats, such as SBML (44), BioPAX (45) or the Cytoscape SIF format (46), greatly facilitate database entry, model curation and subsequent computational analysis. Four publications provided models in both graphical and machine-readable formats (32,39–41). For the remaining seven, models were manually curated from published figures (30,31,33–36,38).
Manual curation involved downloading figures containing each network model, and then transcribing the genes and interactions in the models into a machine-readable format. For most publications, one figure, or each subpanel in a figure, contained a single network model. However, in three publications (31,34,38) the figures contained multiple, unconnected networks that were not divided by the authors into separate subpanels. In these cases, each unconnected component was entered as one model in CellCircuits, and in one case, networks were further subdivided into smaller models if they contained several sparsely connected, but functionally annotated, clusters of proteins (see Supplementary Table S1). These curation activities resulted in a total of 2019 protein network models in the database. Models in the database include protein interactions from five organisms: yeast (Saccharomyces cerevisiae; 91% of all models), fly (Drosophila melanogaster; 58%), nematode worm (Caenorhabditis elegans; 27%), a malarial parasite (Plasmodium falciparum; 2%) and human (2%; these percentages total >100% due to cross-species comparisons covering multiple species in a single model). The models include up to four types of interactions (protein–protein, protein–DNA, genetic and metabolic) as well as two types of external data (gene expression and gene deletion phenotypes). Network model query Models in the CellCircuits database are queried through a web-based interface. In the simplest use case, entering a standard gene name (e.g. RAD9) into the search field will return all models containing that gene. Wild-card searches are permitted (e.g. RAD* will search for models containing any gene with a name that begins with the letters RAD, see Figure 3
Searches based on gene function are also supported. The CellCircuits database automatically scores all models for GO functional enrichment using the hypergeometric test (see Materials and Methods). Such tests had been originally applied in only 3 out of the 11 curated publications. The enrichment results are stored with each model in the database as meta-data, allowing users to search for models that are enriched for genes having a particular annotation. For example, some of the same models retrieved by searching for RAD9 can also be retrieved by searching for GO annotations associated with this gene. Queries may include exact GO ID numbers (e.g. GO:0006974) or partial or complete GO term names (e.g. ‘DNA damage’ or ‘integrity checkpoint’; these must be enclosed in double quotes). More than one gene, GO annotation or wild-card may be included in a query. If a model matches multiple search terms, it will be ranked higher in the results. All search results include graphical representations of the models, links to the original publication, the organism(s) modeled, the genes or GO annotations from the search query that were found in each model and the hypergeometric P-value of enrichment for any GO annotations (Figure 3 Meta-analysis of models Collecting published network models within a single database allowed us to survey the state of computational analysis of large interaction datasets. Scoring all models for GO functional enrichment (described in the previous section) is an example of such analyses. Another example, the observed sizes of models from all 11 publications, is shown in Figure 4a
To assess the overlap between models, we examined the extent to which the same proteins appeared in multiple models (Figure 4b The results of our model overlap analyses are accessible through the web interface. Each model is annotated in the CellCircuits database with a list of similar models, defined as those that contain at least three of the same genes. Clicking the ‘View similar models’ link in the search results will display these models (Figure 3 On a broader scale, we also assessed the extent to which publications covered overlapping regions of the protein interactome using a pairwise similarity score (see Materials and Methods). Results are shown in Figure 4c DISCUSSION In summary, CellCircuits version 1.0 provides a clearinghouse in which hypothetical pathway models derived from large-scale protein networks may be easily accessed, queried and exported for further study. The 11 publications included in this initial release were chosen to cover a broad range of network model types with a bias towards publications that provided models in both graphical and machine-readable format. Beyond this proof-of-principle, a significant question is whether, or to what extent, all past and future network models might be incorporated. On one hand, the field of network biology is still young such that the number of relevant previous publications is probably <50. On the other hand, the rapid adoption of systems and network approaches will make capturing information from all future works a daunting prospect if the models are not readily accessible. CellCircuits complements existing efforts that have begun to address this challenge, such as markup languages for describing models [BioPAX (45) and SBML (44)] and the BioModels Database of quantitative, kinetic models (27). Similar to biological sequence and microarray databases, we envision CellCircuits as a valuable resource for storing, accessing and updating network models across the wider biological research community. SUPPLEMENTARY DATA Supplementary Data are available at NAR Online. Acknowledgments We acknowledge funding from the National Science Foundation (NSF 0425926) and thank the members of the Ideker lab for testing and suggesting improvements to the web interface. Funding to pay the Open Access publication charges for this article was provided by the National Science Foundation (NSF 0425926). Conflict of interest statement. None declared. REFERENCES 1. Harbison C.T., Gordon D.B., Lee T.I., Rinaldi N.J., Macisaac K.D., Danford T.W., Hannett N.M., Tagne J.B., Reynolds D.B., Yoo J., et al. Transcriptional regulatory code of a eukaryotic genome. Nature. 2004;431:99–104. [PubMed] 2. Cusick M.E., Klitgord N., Vidal M., Hill D.E. Interactome: gateway into systems biology. Hum. Mol. Genet. 2005;14:R171–R181. [PubMed] 3. Reguly T., Breitkreutz A., Boucher L., Breitkreutz B.-J., Hon G., Myers C., Parsons A., Friesen H., Oughtred R., Tong A., et al. Comprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae. J. Biol. 2006;5:11. [PubMed] 4. Ooi S.L., Pan X., Peyser B.D., Ye P., Meluh P.B., Yuan D.S., Irizarry R.A., Bader J.S., Spencer F.A., Boeke J.D. Global synthetic-lethality analysis and yeast functional profiling. Trends Genet. 2006;22:56–63. [PubMed] 5. Stuart J.M., Segal E., Koller D., Kim S.K. A gene-coexpression network for global discovery of conserved genetic modules. Science. 2003;302:249–255. [PubMed] 6. Krallinger M., Valencia A. Text-mining and information-retrieval services for molecular biology. Genome Biol. 2005;6:224. [PubMed] 7. Bader J.S., Chaudhuri A., Rothberg J.M., Chant J. Gaining confidence in high-throughput protein interaction networks. Nat. Biotechnol. 2004;22:78–85. [PubMed] 8. von Mering C., Krause R., Snel B., Cornell M., Oliver S.G., Fields S., Bork P. Comparative assessment of large-scale data sets of protein-protein interactions. Nature. 2002;417:399–403. [PubMed] 9. Jansen R., Yu H., Greenbaum D., Kluger Y., Krogan N.J., Chung S., Emili A., Snyder M., Greenblatt J.F., Gerstein M. A Bayesian networks approach for predicting protein-protein interactions from genomic data. Science. 2003;302:449–453. [PubMed] 10. Lee I., Date S.V., Adai A.T., Marcotte E.M. A probabilistic functional network of yeast genes. Science. 2004;306:1555–1558. [PubMed] 11. Joyce A.R., Palsson B.O. The model organism as a system: integrating ‘omics’ data sets. Nature Rev. Mol. Cell Biol. 2006;7:198–210. [PubMed] 12. Sharan R., Ideker T. Modeling cellular machinery through biological network comparison. Nat. Biotechnol. 2006;24:427–433. [PubMed] 13. Vidal M. Interactome modeling. FEBS Lett. 2005;579:1834–1838. [PubMed] 14. Xenarios I., Salwinski L., Duan X.J., Higney P., Kim S.M., Eisenberg D. DIP, the Database of Interacting Proteins: a research tool for studying cellular networks of protein interactions. Nucleic Acids Res. 2002;30:303–305. [PubMed] 15. Mewes H.W., Frishman D., Mayer K.F., Munsterkotter M., Noubibou O., Pagel P., Rattei T., Oesterheld M., Ruepp A., Stumpflen V. MIPS: analysis and annotation of proteins from whole genomes in 2005. Nucleic Acids Res. 2006;34:D169–D172. [PubMed] 16. Bader G.D., Betel D., Hogue C.W. BIND: the Biomolecular Interaction Network Database. Nucleic Acids Res. 2003;31:248–250. [PubMed] 17. Stark C., Breitkreutz B.-J., Reguly T., Boucher L., Breitkreutz A., Tyers M. BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 2006;34:D535–D539. [PubMed] 18. Hermjakob H., Montecchi-Palazzi L., Lewington C., Mudali S., Kerrien S., Orchard S., Vingron M., Roechert B., Roepstorff P., Valencia A., et al. IntAct: an open source molecular interaction database. Nucleic Acids Res. 2004;32:D452–D455. [PubMed] 19. Joshi-Tope G., Gillespie M., Vastrik I., D'Eustachio P., Schmidt E., de Bono B., Jassal B., Gopinath G.R., Wu G.R., Matthews L., et al. Reactome: a knowledgebase of biological pathways. Nucleic Acids Res. 2005;33:D428–D432. [PubMed] 20. Caspi R., Foerster H., Fulcher C.A., Hopkinson R., Ingraham J., Kaipa P., Krummenacker M., Paley S., Pick J., Rhee S.Y., et al. MetaCyc: a multiorganism database of metabolic pathways and enzymes. Nucleic Acids Res. 2006;34:D511–D516. [PubMed] 21. Kanehisa M., Goto S., Hattori M., Aoki-Kinoshita K.F., 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] 22. Gough N.R., Ray L.B. Mapping cellular signaling. Sci. STKE. 2002;2002:EG8. [PubMed] 23. Ananko E.A., Podkolodny N.L., Stepanenko I.L., Podkolodnaya O.A., Rasskazov D.A., Miginsky D.S., Likhoshvai V.A., Ratushny A.V., Podkolodnaya N.N., Kolchanov N.A. GeneNet in 2005. Nucleic Acids Res. 2005;33:D425–D427. [PubMed] 24. Krull M., Pistor S., Voss N., Kel A., Reuter I., Kronenberg D., Michael H., Schwarzer K., Potapov A., Choi C., et al. TRANSPATH(R): an information resource for storing and visualizing signaling pathways and their pathological aberrations. Nucleic Acids Res. 2006;34:D546–D551. [PubMed] 25. Karp P.D. Call for an enzyme genomics initiative. Genome Biol. 2004;5:401. [PubMed] 26. Roberts R.J. Identifying protein function—a call for community action. PLoS Biol. 2004;2:E42. [PubMed] 27. Le Novere N., Bornstein B., Broicher A., Courtot M., Donizelli M., Dharuri H., Li L., Sauro H., Schilstra M., Shapiro B., et al. BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems. Nucleic Acids Res. 2006;34:D689–D691. [PubMed] 28. Feller W. An Introduction to Probability Theory and Its Application, 3rd edn. NY: John Wiley & Sons, Inc.; 1968. 29. Boyle E.I., Weng S., Gollub J., Jin H., Botstein D., Cherry J.M., Sherlock G. GO::TermFinder—open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genes. Bioinformatics. 2004;20:3710–3715. [PubMed] 30. Bernard A., Hartemink A.J. Informative structure priors: joint learning of dynamic regulatory networks from multiple types of data. Pac. Symp. Biocomput. 2005;2005:459–470. [PubMed] 31. Hartemink A.J., Gifford D.K., Jaakkola T.S., Young R.A. Combining location and expression data for principled discovery of genetic regulatory network models. Pac. Symp. Biocomput. 2002;2002:437–449. [PubMed] 32. Yeang C.H., Mak H.C., McCuine S., Workman C., Jaakkola T., Ideker T. Validation and refinement of gene-regulatory pathways on a network of physical interactions. Genome Biol. 2005;6:R62. [PubMed] 33. Begley T.J., Rosenbach A.S., Ideker T., Samson L.D. Damage recovery pathways in Saccharomyces cerevisiae revealed by genomic phenotyping and interactome mapping. Mol. Cancer Res. 2002;1:103–112. [PubMed] 34. de Lichtenberg U., Jensen L.J., Brunak S., Bork P. Dynamic complex formation during the yeast cell cycle. Science. 2005;307:724–727. [PubMed] 35. Haugen A.C., Kelley R., Collins J.B., Tucker C.J., Deng C., Afshari C.A., Brown J.M., Ideker T., Van Houten B. Integrating phenotypic and expression profiles to map arsenic-response networks. Genome Biol. 2004;5:R95. [PubMed] 36. Ideker T., Ozier O., Schwikowski B., Siegel A.F. Discovering regulatory and signaling circuits in molecular interaction networks. Bioinformatics. 2002;18(Suppl. 1):S233–S240. [PubMed] 37. Maciag K., Altschuler S.J., Slack M.D., Krogan N.J., Emili A., Greenblatt J.F., Maniatis T., Wu L.F. Systems-level analyses identify extensive coupling among gene expression machines. Mol. Syst. Biol. 2006;2:E1–E14. 38. Gandhi T.K., Zhong J., Mathivanan S., Karthick L., Chandrika K.N., Mohan S.S., Sharma S., Pinkert S., Nagaraju S., Periaswamy B., et al. Analysis of the human protein interactome and comparison with yeast, worm and fly interaction datasets. Nature Genet. 2006;38:285–293. [PubMed] 39. Sharan R., Suthram S., Kelley R.M., Kuhn T., McCuine S., Uetz P., Sittler T., Karp R.M., Ideker T. Conserved patterns of protein interaction in multiple species. Proc. Natl Acad. Sci. USA. 2005;102:1974–1979. [PubMed] 40. Suthram S., Sittler T., Ideker T. The Plasmodium protein network diverges from those of other eukaryotes. Nature. 2005;438:108–112. [PubMed] 41. Kelley R., Ideker T. Systematic interpretation of genetic interactions using protein networks. Nat. Biotechnol. 2005;23:561–566. [PubMed] 42. Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U. Network motifs: simple building blocks of complex networks. Science. 2002;298:824–827. [PubMed] 43. Schneider T.D., Stephens R.M. Sequence logos: a new way to display consensus sequences. Nucleic Acids Res. 1990;18:6097–6100. [PubMed] 44. Hucka M., Finney A., Sauro H.M., Bolouri H., Doyle J.C., Kitano H., Arkin A.P., Bornstein B.J., Bray D., Cornish-Bowden A., et al. The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models. Bioinformatics. 2003;19:524–531. [PubMed] 45. BioPAX working group. 2004. BioPAX—biological pathways exchange language. Level 1, Version 1.0 Documentation. 46. Shannon P., Markiel A., Ozier O., Baliga N.S., Wang J.T., 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] 47. Harris M.A., Clark J., Ireland A., Lomax J., Ashburner M., Foulger R., Eilbeck K., Lewis S., Marshall B., Mungall C., et al. The Gene Ontology (GO) database and informatics resource. Nucleic Acids Res. 2004;32:D258–D261. [PubMed] 48. Zanzoni A., Montecchi-Palazzi L., Quondam M., Ausiello G., Helmer-Citterich M., Cesareni G. MINT: a Molecular INTeraction database. FEBS Lett. 2002;513:135–140. [PubMed] |
PubMed related articles
Your browsing activity is empty. Activity recording is turned off. |
|||||||||||||
Nature. 2004 Sep 2; 431(7004):99-104.
[Nature. 2004]J Biol. 2006; 5(4):11.
[J Biol. 2006]Trends Genet. 2006 Jan; 22(1):56-63.
[Trends Genet. 2006]Science. 2003 Oct 10; 302(5643):249-55.
[Science. 2003]Genome Biol. 2005; 6(7):224.
[Genome Biol. 2005]Nucleic Acids Res. 2002 Jan 1; 30(1):303-5.
[Nucleic Acids Res. 2002]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D169-72.
[Nucleic Acids Res. 2006]Nucleic Acids Res. 2003 Jan 1; 31(1):248-50.
[Nucleic Acids Res. 2003]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D535-9.
[Nucleic Acids Res. 2006]Nucleic Acids Res. 2004 Jan 1; 32(Database issue):D452-5.
[Nucleic Acids Res. 2004]Nat Rev Mol Cell Biol. 2006 Mar; 7(3):198-210.
[Nat Rev Mol Cell Biol. 2006]FEBS Lett. 2005 Mar 21; 579(8):1834-8.
[FEBS Lett. 2005]Genome Biol. 2004; 5(8):401.
[Genome Biol. 2004]PLoS Biol. 2004 Mar; 2(3):E42.
[PLoS Biol. 2004]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D689-91.
[Nucleic Acids Res. 2006]Bioinformatics. 2004 Dec 12; 20(18):3710-5.
[Bioinformatics. 2004]Pac Symp Biocomput. 2005; ():459-70.
[Pac Symp Biocomput. 2005]Genome Biol. 2005; 6(7):R62.
[Genome Biol. 2005]Mol Cancer Res. 2002 Dec; 1(2):103-12.
[Mol Cancer Res. 2002]Nat Genet. 2006 Mar; 38(3):285-93.
[Nat Genet. 2006]Nature. 2005 Nov 3; 438(7064):108-12.
[Nature. 2005]Mol Cancer Res. 2002 Dec; 1(2):103-12.
[Mol Cancer Res. 2002]Genome Biol. 2004; 5(12):R95.
[Genome Biol. 2004]Bioinformatics. 2002; 18 Suppl 1():S233-40.
[Bioinformatics. 2002]Science. 2005 Feb 4; 307(5710):724-7.
[Science. 2005]Science. 2002 Oct 25; 298(5594):824-7.
[Science. 2002]Nucleic Acids Res. 1990 Oct 25; 18(20):6097-100.
[Nucleic Acids Res. 1990]Bioinformatics. 2003 Mar 1; 19(4):524-31.
[Bioinformatics. 2003]Genome Res. 2003 Nov; 13(11):2498-504.
[Genome Res. 2003]Genome Biol. 2005; 6(7):R62.
[Genome Biol. 2005]Proc Natl Acad Sci U S A. 2005 Feb 8; 102(6):1974-9.
[Proc Natl Acad Sci U S A. 2005]Pac Symp Biocomput. 2002; ():437-49.
[Pac Symp Biocomput. 2002]Science. 2005 Feb 4; 307(5710):724-7.
[Science. 2005]Nat Genet. 2006 Mar; 38(3):285-93.
[Nat Genet. 2006]Nucleic Acids Res. 2004 Jan 1; 32(Database issue):D258-61.
[Nucleic Acids Res. 2004]Proc Natl Acad Sci U S A. 2005 Feb 8; 102(6):1974-9.
[Proc Natl Acad Sci U S A. 2005]Nat Biotechnol. 2005 May; 23(5):561-6.
[Nat Biotechnol. 2005]Proc Natl Acad Sci U S A. 2005 Feb 8; 102(6):1974-9.
[Proc Natl Acad Sci U S A. 2005]Nat Biotechnol. 2005 May; 23(5):561-6.
[Nat Biotechnol. 2005]Bioinformatics. 2003 Mar 1; 19(4):524-31.
[Bioinformatics. 2003]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D689-91.
[Nucleic Acids Res. 2006]Nucleic Acids Res. 2002 Jan 1; 30(1):303-5.
[Nucleic Acids Res. 2002]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D535-9.
[Nucleic Acids Res. 2006]FEBS Lett. 2002 Feb 20; 513(1):135-40.
[FEBS Lett. 2002]Nucleic Acids Res. 2004 Jan 1; 32(Database issue):D452-5.
[Nucleic Acids Res. 2004]Nucleic Acids Res. 2006 Jan 1; 34(Database issue):D169-72.
[Nucleic Acids Res. 2006]Pac Symp Biocomput. 2002; ():437-49.
[Pac Symp Biocomput. 2002]Science. 2005 Feb 4; 307(5710):724-7.
[Science. 2005]Nature. 2005 Nov 3; 438(7064):108-12.
[Nature. 2005]Nat Biotechnol. 2005 May; 23(5):561-6.
[Nat Biotechnol. 2005]