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

Authors:
Bhaskar DasGupta;German A. Enciso;Eduardo Sontag;Yi Zhang
Affiliations:
Department of Computer Science, University of IL at Chicago, Chicago, IL;Mathematical Biosciences Institute, Columbus, OH;Department of Mathematics, Rutgers University, New Brunswick, NJ;Department of Computer Science, University of IL at Chicago, Chicago, IL
Venue:
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Year:
2006

Citing 3
Cited 3

Systems of ordinary differential equations which generate an order preserving flow. A survey of results

SIAM Review
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Mathematical control theory: deterministic finite dimensional systems (2nd ed.)

Mathematical control theory: deterministic finite dimensional systems (2nd ed.)

Additive edge labelings

Discrete Applied Mathematics
Optimal edge deletions for signed graph balancing

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A novel method for signal transduction network inference from indirect experimental evidence

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

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 inapproximability 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 [14]. The algorithm was implemented and tested on a Drosophila segmentation network [7] and an Epidermal Growth Factor Receptor pathway model [25], and it was found to perform close to optimally.