Analyzing Networks with VisANT
互联网
1101
- Abstract
- Table of Contents
- Figures
- Literature Cited
Abstract
The VisANT tool, accessible from any recent Java?enabled browser, is a platform?independent, flexible, Web?enabled program for quick and simple construction, visualization, and analysis of molecular and higher order networks based on functional (e.g., expression profiles, phylogenetic profiles) and physical (e.g., yeast two?hybrid, chromatin?immunoprecipitation) relations from either the Predictome database or user?defined data sets. Analysis capabilities include identification of feed?forward and ?back loops, shortest paths, and node degree distribution. Additionally, network constructs can be saved, accessed, and shared online. VisANT is able to develop and display meta?networks for meta?nodes that are structural complexes or pathways (soon including nodes representing any kind of dense cluster). Further, VisANT supports a growing number of standard exchange formats and database referencing standards, e.g., KEGG/KGML, BioPAX (in progress), GenBank, Gene Ontology. Multiple species are supported to the extent that computed or experimental evidence of interactions or associations are available (i.e., public datasets or Predictome database).
Keywords: interaction; network; meta?network; visualization; integration
GO TO THE FULL PROTOCOL:
PDF or HTML at Wiley Online LibraryTable of Contents
- Basic Protocol 1: Basic Network Construction
- Alternate Protocol 1: Constructing and Comparing Large‐Scale Networks
- Support Protocol 1: Quantitative Characteristics of Network Topologies
- Support Protocol 2: Online Saving and Reading of the Network
- Basic Protocol 2: Analyzing the Biological Network
- Basic Protocol 3: Meta‐Networks: An Application to Protein Complexes
- Commentary
- Literature Cited
- Figures
GO TO THE FULL PROTOCOL:
PDF or HTML at Wiley Online LibraryMaterials
GO TO THE FULL PROTOCOL:
PDF or HTML at Wiley Online LibraryFigures
-
Figure 8.8.1 Relationships between protocols. Protocols are colored by type, with the direction of the line indicating relationship—for example, the is used by and . To distinguish the relationships of the Support Protocols, dashed lines are used for . View Image -
Figure 8.8.2 The VisANT start page. View Image -
Figure 8.8.3 VisANT main window. View Image -
Figure 8.8.4 Methods table. View Image -
Figure 8.8.5 Searching interactions of FUS1 and STE3 proteins. The circles represent genes or proteins, depending on the assay by which the relations were obtained; the connecting lines (links) represent relations established by the selected methods. The methods table can be viewed by clicking on the View menu in the menu bar. A minus sign (−) in the node indicates that the interaction has been expanded (i.e., all links are shown) while a plus symbol (+) indicates that links remain hidden. View Image -
Figure 8.8.6 The difference between three spring‐forces‐based layout algorithms. View Image -
Figure 8.8.7 The result after invoking a relaxation algorithm. In this case the Elegant Relaxation algorithm was used (see descriptions below). View Image -
Figure 8.8.8 How to select all the nodes in the network panel. Note that selected nodes are clearly marked on the screen. View Image -
Figure 8.8.9 Querying all the nodes in the network panel. View Image -
Figure 8.8.10 A low resolution view of the network that contains STE3 and FUS1. View Image -
Figure 8.8.11 Shortest paths between STE3 and FUS1. View Image -
Figure 8.8.12 PPI network (yeast two hybrid) of S. cerevisiae . View Image -
Figure 8.8.13 Combined network of PPI (blue region) and genetic network (green) for S. cerevisiae . View Image -
Figure 8.8.14 Status report of the combined network View Image -
Figure 8.8.15 The intersection of the combined network. Each edge is labeled with two colors, indicating that the association is obtained by two methods. View Image -
Figure 8.8.16 Degree distribution of regulatory network (ChIP). View Image -
Figure 8.8.17 Feedback loop retrieved from a complex transcription‐factor/target network. View Image -
Figure 8.8.18 An example of shortest path detection. View Image -
Figure 8.8.19 The network of physical interactions within which STE3 and FUS1 are embedded. View Image -
Figure 8.8.20 Network after collapse of a set of nodes. View Image -
Figure 8.8.21 The pruned physical interaction network containing FUS1 and STE3. View Image -
Figure 8.8.22 Node Properties window. View Image -
Figure 8.8.23 Network with annotated shortest path between FUS1 and STE3. View Image -
Figure 8.8.24 Adding node annotation from a linked data source. View Image -
Figure 8.8.25 Integration of different data sources. Complexes (meta‐nodes) were determined by tandem affinity mass spectrometry (Gavin et al., ); the internal connections were determined by a variety of methods as indicated. (A ) Network of protein complex after it has been laid out. The rectangle represents the region of interest for zoom‐in. (B ) The region of interest of the network after zoom‐in, with several complexes labeled according to its original reference. (C ) Internal network structure of Complex 153 after integration with the interaction data from the Predictome database. All nodes are connected. (D ) Internal network structure of Complex 175 after integration with the data from Predictome database. View Image -
Figure 8.8.26 Degree distribution of complex network: the power‐law does not hold. View Image
Videos
Literature Cited
| Ashburner, M., Ball, C.A., Blake, J.A., Botstein, D., Butler, H., Cherry, J.M., Davis, A.P., Dolinski, K., Dwight, S.S., Eppig, J.T., Harris, M.A., Hill, D.P., Issel‐Tarver, L., Kasarskis, A., Lewis, S., Matese, J.C., Richardson, J.E., Ringwald, M., Rubin, G.M., and Sherlock, G. 2000. Gene ontology: Tool for the unification of biology. The Gene Ontology Consortium. Nat. Genet. 25:25‐29. | |
| Bader, G.D., Betel, D., and Hogue, C.W. 2003. BIND: The Biomolecular Interaction Network Database. Nucleic Acids Res. 31:248‐250. | |
| Benson, D.A., Karsch‐Mizrachi, I., Lipman, D.J., Ostell, J., Wheeler, D.L. 2003. GenBank. Nucleic Acids Res. 31:23‐27. | |
| McMullan, G., Christie, J.M., Rahman, T.J., Banat, I.M., Ternan, N.G., and Marchant R. 2004. Saccharomyces Genome Database (SGD) provides tools to identify and analyze sequences from Saccharomyces cerevisiae and related sequences from other organisms. Nucleic Acids Res. 32 Database issue:D311‐D314. | |
| Gavin, A.C., Bosche, M., Krause, R., Grandi, P., Marzioch, M., Bauer, A., Schultz, J., Rick, J.M., Michon, A.M., Cruciat, C.M., Remor, M., Hofert, C., Schelder, M., Brajenovic, M., Ruffner, H., Merino, A., Klein, K., Hudak, M., Dickson, D., Rudi, T., Gnau, V., Bauch, A., Bastuck, S., Huhse, B., Leutwein, C., Heurtier, M.A., Copley, R.R., Edelmann, A., Querfurth, E., Rybin, V., Drewes, G., Raida, M., Bouwmeester, T., Bork, P., Seraphin, B., Kuster, B., Neubauer, G., and Superti‐Furga, G. 2002. Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415:141‐147. | |
| Gelbart, W.M., Crosby, M., Matthews, B., Rindone, W.P., Chillemi, J., Russo Twombly, S., Emmert, D., Ashburner, M., Drysdale, R.A., Whitfield, E., Millburn, G.H., de Grey, A., Kaufman, T., Matthews, K., Gilbert, D., Strelets, V., and Tolstoshev, C. 1997. FlyBase: A Drosophila database. The FlyBase consortium. Nucleic Acids Res. 25:63‐66. | |
| Hermjakob, H., Montecchi‐Palazzi, L., Bader, G., Wojcik, J., Salwinski, L., Ceol, A., Moore, S., Orchard, S., Sarkans, U., von Mering, C., Roechert, B., Poux, S., Jung, E., Mersch, H., Kersey, P., Lappe, M., Li, Y., Zeng, R., Rana, D., Nikolski, M., Husi, H., Brun, C., Shanker, K., Grant, S.G., Sander, C., Bork, P., Zhu, W., Pandey, A., Brazma, A., Jacq, B., Vidal, M., Sherman, D., Legrain, P., Cesareni, G., Xenarios, I., Eisenberg, D., Steipe, B., Hogue, C., and Apweiler, R. 2004. The HUPO PSI's molecular interaction format–a community standard for the representation of protein interaction data. Nat. Biotechnol. 22:177‐183. | |
| Imoto, S., Kim, S., Goto, T., Miyano, S., Aburatani, S., Tashiro, K., and Kuhara, S. 2003. Bayesian network and nonparametric heteroscedastic regression for nonlinear modeling of genetic network. J. Bioinform. Comput. Biol. 1:231‐252. | |
| Kanehisa, M., Goto, S., Kawashima, S., and Nakaya, A. 2002. The KEGG databases at GenomeNet. Nucleic Acids Res. 30:42‐46. | |
| Kim, S., Imoto, S., and Miyano, S. 2004. Dynamic Bayesian network and nonparametric regression for nonlinear modeling of gene networks from time series gene expression data. Biosystems 75:57‐65. | |
| Lee, T.I., Rinaldi, N.J., Robert, F., Odom, D.T., Bar‐Joseph, Z., Gerber, G.K., Hannett, N.M., Harbison, C.T., Thompson, C.M., Simon, I., Zeitlinger, J., Jennings, E.G., Murray, H.L., Gordon, D.B., Ren, B., Wyrick, J.J., Tagne, J.B., Volkert, T.L., Fraenkel, E., Gifford, D.K., Young, R.A. 2002. Transcriptional regulatory networks in Saccharomyces cerevisiae. Science 298:799‐804. | |
| Mellor, J.C., Yanai, I., Clodfelter, K.H., Mintseris, J., DeLisi, C. 2002. Predictome: A database of putative functional links between proteins. Nucleic Acids Res. 30:306‐309. | |
| Mewes, H.W., Frishmanm D., Gruber, C., Geier, B., Haase, D., Kaps, A., Lemcke, K., Mannhaupt, G., Pfeiffer, F., Schuller, C., Stocker, S., Weil, B. 2000. MIPS: A database for genomes and protein sequences. Nucleic Acids Res. 28:37‐40. | |
| Povey, S., Lovering, R., Bruford, E., Wright, M., Lush, M., Wain, H. 2001. The HUGO Gene Nomenclature Committee (HGNC). Hum. Genet. 109:678‐680. | |
| Tong, A.H., Evangelista, M., Parsons, A.B., Xu, H., Bader, G.D., Page, N., Robinson, M., Raghibizadeh, S., Hogue, C.W., Bussey, H., Andrews, B., Tyers, M., and Boone, C. 2001. Systematic genetic analysis with ordered arrays of yeast deletion mutants. Science 294:2364‐2368. | |
| Uetz, P., Giot, L., Cagney, G., Mansfield, T.A., Judson, R.S., Knight, J.R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., Qureshi‐Emili, A., Li, Y., Godwin, B., Conover, D., Kalbfleisch, T., Vijayadamodar, G., Yang, M., Johnston, M., Fields, S., and Rothberg, J.M. 2000. A comprehensive analysis of protein‐protein interactions in Saccharomyces cerevisiae. Nature 403:623‐627. | |
| Wang, H., Tang, X., Liu, J., Trautmann, S., Balasundaram, D., McCollum, D., and Balasubramanian, M.K. 2002. The multiprotein exocyst complex is essential for cell separation in Schizosaccharomyces pombe. Mol. Biol. Cell 13:515‐529. | |
| Yu, J., Smith, V.A., Wang, P.P., Hartemink, A.J., and Jarvis, E.D. 2004. Advances to Bayesian network inference for generating causal networks from observational biological data. Bioinformatics. [available online ahead of print at http://bioinformatics.oupjournals.org/cgi/reprint/bth448v1] | |
| Yanai, I. and DeLisi, C. 2002. The society of genes: Networks of functional links between genes from comparative genomics. Genome Biol. 25:research0064. [Epub at http://www.pubmedcentral.nih.gov/articlerender.fcgi?tool=pubmed&pubmedid=12429063] | |
| Key References | |
| Hu, Z., Mellor, J., Wu, J., DeLisi, C. 2004. VisANT: An online visualization and analysis tool for biological interaction data. BMC Bioinformatics 5:17. | |
| Explains the design principals and future development of VisANT. | |
| Mellor et al., 2002. See above. | |
| Introduces the development of Predictome database. | |
| Internet Resources | |
| http://visant.bu.edu | |
| VisANT homepage. | |
| http://visant.bu.edu/vmanual | |
| The VisANT user's manual. | |
| http://predictome.bu.edu | |
| Homepage for the Predictome database | |
| http://java.sun.com | |
| Free source of Java run‐time environment 1.4 or above. Refer to VisANT user manual for detailed instruction. |
GO TO THE FULL PROTOCOL:
PDF or HTML at Wiley Online Library
