Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
Bhaskar DasGupta, German Andres Enciso, Eduardo Sontag, Yi Zhang
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 percent from optimality, is based on the semidefinite programming relaxation approach of Goemans-Williamson. The algorithm was implemented and tested on a Drosophila segmentation network and an Epidermal Growth Factor Receptor pathway model, and it was found to perform close to optimally.
Create a lesson
Related papers
Artificial Intelligence-Assisted Systems Biology Reconstruction of Diabetic Bone Marrow Dysfunction
Paolo Madeddu
IMPPAT 3.0: An updated FAIR database of phytochemicals and formulations of Indian Medicinal plants
Shanmuga Priya Baskaran, Ajaya Kumar Sahoo, Priyotosh Sil et al.
Protocol for Discovering Convergent Molecular Networks across Multi-Omics Datasets Using Network Propagation
Charles O. Olwal, Declan M. Winters, Immy A. Ashley et al.
An interactive simulator for integrating biochemical models with experimental data
Herbert M. Sauro, Dan Nguyen, Long Nguyenle et al.
Large-deviations theory for growing chemical reaction networks
Praful Gagrani, Ignacio Madrid, Tetsuya J Kobayashi
Minimality in Reflexive and Stoichiometric Autocatalysis
Richard Golnik, Thomas Gatter, Wim Hordijk et al.