47
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Biological context networks: a mosaic view of the interactome

      research-article

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Network models are a fundamental tool for the visualization and analysis of molecular interactions occurring in biological systems. While broadly illuminating the molecular machinery of the cell, graphical representations of protein interaction networks mask complex patterns of interaction that depend on temporal, spatial, or condition-specific contexts. In this paper, we introduce a novel graph construct called a biological context network that explicitly captures these changing patterns of interaction from one biological context to another. We consider known gene ontology biological process and cellular component annotations as a proxy for context, and show that aggregating small process-specific protein interaction sub-networks leads to the emergence of observed scale-free properties. The biological context model also provides the basis for characterizing proteins in terms of several context-specific measures, including ‘interactive promiscuity,' which identifies proteins whose interacting partners vary from one context to another. We show that such context-sensitive measures are significantly better predictors of knockout lethality than node degree, reaching better than 70% accuracy among the top scoring proteins.

          Related collections

          Most cited references35

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Emergence of scaling in random networks

          Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites. A model based on these two ingredients reproduces the observed stationary scale-free distributions, indicating that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Error and attack tolerance of complex networks

            Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks. We find that scale-free networks, describing a number of systems, such as the World Wide Web, Internet, social networks or a cell, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates. However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Lethality and centrality in protein networks

              In this paper we present the first mathematical analysis of the protein interaction network found in the yeast, S. cerevisiae. We show that, (a) the identified protein network display a characteristic scale-free topology that demonstrate striking similarity to the inherent organization of metabolic networks in particular, and to that of robust and error-tolerant networks in general. (b) the likelihood that deletion of an individual gene product will prove lethal for the yeast cell clearly correlates with the number of interactions the protein has, meaning that highly-connected proteins are more likely to prove essential than proteins with low number of links to other proteins. These results suggest that a scale-free architecture is a generic property of cellular networks attributable to universal self-organizing principles of robust and error-tolerant networks and that will likely to represent a generic topology for protein-protein interactions.
                Bookmark

                Author and article information

                Journal
                Mol Syst Biol
                Molecular Systems Biology
                1744-4292
                2006
                28 November 2006
                : 2
                : 66
                Affiliations
                [1 ]Department of Computer Science, Boston University, Boston, MA, USA
                [2 ]Center for Advanced Genomic Technologies, Boston University, Boston, MA, USA
                [3 ]Department of Biomedical Engineering, Boston University, Boston, MA, USA
                [4 ]Center for Advanced Biotechnology, Boston University, Boston, MA, USA
                [5 ]SEQUENOM Inc., San Diego, CA, USA
                [6 ]Children's Hospital Boston, Boston, MA, USA
                Author notes
                [a ]Department of Computer Science, Boston University, 111 Cummington Ave, Boston, MA 02215, USA. Tel.: +1 617 921 9669; Fax: +1 617 353 4814; E-mail: rachlin@ 123456bu.edu
                Article
                msb4100103
                10.1038/msb4100103
                1693461
                17130868
                00083121-902a-4f73-8c80-d6bb56c31d6b
                Copyright © 2006, EMBO and Nature Publishing Group
                History
                : 30 January 2006
                : 22 September 2006
                Page count
                Pages: 1
                Categories
                Article

                Quantitative & Systems biology
                biological context,scale-free networks,network models,bioinformatics,ppi networks

                Comments

                Comment on this article