Algorithmic and complexity results for decompositions of biological networks into monotone subsystems.

Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607, United States; Mathematical Biosciences Institute, 250 Mathematics Building, 231 W 18th Avenue, Columbus, OH 43210, United States; Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, United States; Received 23 January 2006. Revised 3 August 2006. Accepted 3 August 2006. Available online 12 August 2006.
Biosystems 01/2007; 90:161-178. DOI: 10.1007/11764298_23
Source: DBLP

ABSTRACT A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions which are optimal in an appropriate sense. In graph-theoretic language, the problems can be recast in terms of maximal sign-consistent subgraphs. The theoretical results include polynomial-time approximation algorithms as well as constant-ratio inapproximabil- ity results. One of the algorithms, which has a worst-case guarantee of 87.9% from optimality, is based on the semidefinite programming relaxation approach of Goemans- Williamson (23). The algorithm was implemented and tested on a Drosophila segmen- tation network and an Epidermal Growth Factor Receptor pathway model, and it was found to perform close to optimally.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: It is well known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient, and applicable to a variety of directed networks such as cellular signaling, and metabolic and social interaction networks. We demonstrate the computational efficiency of our measure by computing its value and statistical significance on a number of biological and social networks with up to several thousands of nodes and edges. Our results suggest a number of interesting observations: (1) Social networks are more redundant that their biological counterparts, (2) transcriptional networks are less redundant than signaling networks, (3) the topological redundancy of the C. elegans metabolic network is largely due to its inclusion of currency metabolites, and (4) the redundancy of signaling networks is highly (negatively) correlated with the monotonicity of their dynamics.
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics 08/2011; 84(3). · 2.33 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A structurally balanced social network is a social community that splits into two antagonistic factions (typical example being a two-party political system). The process of opinion forming on such a community is most often highly predictable, with polarized opinions reflecting the bipartition of the network. The aim of this paper is to suggest a class of dynamical systems, called monotone systems, as natural models for the dynamics of opinion forming on structurally balanced social networks. The high predictability of the outcome of a decision process is explained in terms of the order-preserving character of the solutions of this class of dynamical systems. If we represent a social network as a signed graph in which individuals are the nodes and the signs of the edges represent friendly or hostile relationships, then the property of structural balance corresponds to the social community being splittable into two antagonistic factions, each containing only friends.
    PLoS ONE 12/2012; 7(6):e38135. · 3.53 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we propose three different graph-theoretical decompositions of large-scale biologi-cal networks, all three aiming at highlighting specific dynamical properties of the system. The first consists in finding a maximal directed acyclic subgraph in the network, which dynamically cor-responds to searching for the maximal open-loop subsystem of the given system. The other two decompositions deal with the strong monotonicity property, and aim at decomposing the system into strongly monotone components with different structural characteristics: a single large strongly con-nected monotone subsystem in one case, and a set of smaller disjoint monotone subsystems in the other. For all three decompositions we provide original heuristic algorithms.

Full-text (2 Sources)

Available from
May 20, 2014