Dataset Information

Computational analyses of synergism in small molecular network motifs.

ABSTRACT: Cellular functions and responses to stimuli are controlled by complex regulatory networks that comprise a large diversity of molecular components and their interactions. However, achieving an intuitive understanding of the dynamical properties and responses to stimuli of these networks is hampered by their large scale and complexity. To address this issue, analyses of regulatory networks often focus on reduced models that depict distinct, reoccurring connectivity patterns referred to as motifs. Previous modeling studies have begun to characterize the dynamics of small motifs, and to describe ways in which variations in parameters affect their responses to stimuli. The present study investigates how variations in pairs of parameters affect responses in a series of ten common network motifs, identifying concurrent variations that act synergistically (or antagonistically) to alter the responses of the motifs to stimuli. Synergism (or antagonism) was quantified using degrees of nonlinear blending and additive synergism. Simulations identified concurrent variations that maximized synergism, and examined the ways in which it was affected by stimulus protocols and the architecture of a motif. Only a subset of architectures exhibited synergism following paired changes in parameters. The approach was then applied to a model describing interlocked feedback loops governing the synthesis of the CREB1 and CREB2 transcription factors. The effects of motifs on synergism for this biologically realistic model were consistent with those for the abstract models of single motifs. These results have implications for the rational design of combination drug therapies with the potential for synergistic interactions.

SUBMITTER: Zhang Y

PROVIDER: S-EPMC3961176 | biostudies-literature | 2014 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Computational analyses of synergism in small molecular network motifs.

Zhang Yili Y Smolen Paul P Baxter Douglas A DA Byrne John H JH

PLoS computational biology 20140320 3

Cellular functions and responses to stimuli are controlled by complex regulatory networks that comprise a large diversity of molecular components and their interactions. However, achieving an intuitive understanding of the dynamical properties and responses to stimuli of these networks is hampered by their large scale and complexity. To address this issue, analyses of regulatory networks often focus on reduced models that depict distinct, reoccurring connectivity patterns referred to as motifs. ...[more]

PMID: 24651495

Similar Datasets

Project description:BackgroundGenerally, the results of high throughput analyses contain information about gene expressions, and about exon expressions. Approximately 90% of primary protein-coding transcripts undergo alternative splicing in mammals. However, changes induced by alternative exons have not been properly analyzed for their impact on important molecular networks or their biological events. Even when alternative exons are identified, they are usually subjected to bioinformatics analysis in the same way as the gene ignoring the possibility of functionality change because of the alteration of domain caused by alternative exon. Here, we reveal an effective computational approach to explore an important molecular network based on potential changes of functionality induced by alternative exons obtained from our comprehensive analysis of neuronal cell differentiation.ResultsFrom our previously identified 262 differentially alternatively spliced exons during neuronal cell differentiations, we extracted 241 sets that changed the amino acid sequences between the alternatively spliced sequences. Conserved domain searches indicated that annotated domain(s) were changed in 128 sets. We obtained 49 genes whose terms overlapped between domain description and gene annotation. Thus, these 49 genes have alternatively differentially spliced in exons that affect their main functions. We performed pathway analysis using these 49 genes and identified the EGFR (epidermal growth factor receptor) and mTOR (mammalian target of rapamycin) signaling pathway as being involved frequently. Recent studies reported that the mTOR pathway is associated with neuronal cell differentiation, vindicating that our approach extracted an important molecular network successfully.ConclusionsEffective informatics approaches for exons should be more complex than those for genes, because changes in alternative exons affect protein functions via alterations of amino acid sequences and functional domains. Our method extracted alterations of functional domains and identified key alternative splicing events. We identified the EGFR and mTOR signaling pathway as the most affected pathway. The mTOR pathway is important for neuronal differentiation, suggesting that this in silico extraction of alternative splicing networks is useful. This preliminary analysis indicated that automated analysis of the effects of alternative splicing would provide a rich source of biologically relevant information.

Project description:A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general.This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author.The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem.

Dataset Information

Computational analyses of synergism in small molecular network motifs.

Publications

Computational analyses of synergism in small molecular network motifs.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets