Journal
BIOINFORMATICS
Volume 28, Issue 1, Pages 76-83Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btr620
Keywords
-
Categories
Funding
- MIUR, Italy
Ask authors/readers for more resources
Motivation: Given a large-scale biological network represented as an influence graph, in this article we investigate possible decompositions of the network aimed at highlighting specific dynamical properties. Results: The first decomposition we study consists in finding a maximal directed acyclic subgraph of the network, which dynamically corresponds to searching for a maximal open-loop subsystem of the given system. Another dynamical property investigated is strong monotonicity. We propose two methods to deal with this property, both aimed at decomposing the system into strongly monotone subsystems, but with different structural characteristics: one method tends to produce a single large strongly monotone component, while the other typically generates a set of smaller disjoint strongly monotone subsystems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available