7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Prediction of lethal and synthetically lethal knock-outs in regulatory networks

      Preprint
      , ,

      Read this article at

      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

          The complex interactions involved in regulation of a cell's function are captured by its interaction graph. More often than not, detailed knowledge about enhancing or suppressive regulatory influences and cooperative effects is lacking and merely the presence or absence of directed interactions is known. Here we investigate to which extent such reduced information allows to forecast the effect of a knock-out or a combination of knock-outs. Specifically we ask in how far the lethality of eliminating nodes may be predicted by their network centrality, such as degree and betweenness, without knowing the function of the system. The function is taken as the ability to reproduce a fixed point under a discrete Boolean dynamics. We investigate two types of stochastically generated networks: fully random networks and structures grown with a mechanism of node duplication and subsequent divergence of interactions. On all networks we find that the out-degree is a good predictor of the lethality of a single node knock-out. For knock-outs of node pairs, the fraction of successors shared between the two knocked-out nodes (out-overlap) is a good predictor of synthetic lethality. Out-degree and out-overlap are locally defined and computationally simple centrality measures that provide a predictive power close to the optimal predictor.

          Related collections

          Most cited references19

          • 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
              • Record: found
              • Abstract: not found
              • Article: not found

              Principles for the buffering of genetic variation.

                Bookmark

                Author and article information

                Journal
                2011-08-30
                2013-02-14
                Article
                10.1007/s12064-012-0164-1
                1108.6062
                859f62d2-07f8-4780-8baf-4cd98a63206c

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Theory in Biosciences 132, 17-25 (2013)
                published version, 10 pages, 6 figures, 2 tables; supplement at http://www.bioinf.uni-leipzig.de/publications/supplements/11-018
                q-bio.MN

                Molecular biology
                Molecular biology

                Comments

                Comment on this article