Internal coarse-graining of molecular systems

  title={Internal coarse-graining of molecular systems},
  author={J{\'e}r{\^o}me Feret and Vincent Danos and Jean Krivine and Russell Harmer and Walter Fontana},
  journal={Proceedings of the National Academy of Sciences},
  pages={6453 - 6458}
Modelers of molecular signaling networks must cope with the combinatorial explosion of protein states generated by posttranslational modifications and complex formation. Rule-based models provide a powerful alternative to approaches that require explicit enumeration of all possible molecular species of a system. Such models consist of formal rules stipulating the (partial) contexts wherein specific protein–protein interactions occur. These contexts specify molecular patterns that are usually… 

Formal Model Reduction

Rule-based models provide a powerful alternative to approaches that require an explicit enumeration of all possible molecular species of a system because the naive computation of these semantics does not scale to large systems, because it does not exploit the lower resolution at which rules specify interactions.

Formal reductions of stochastic rule-based models of biochemical systems

This thesis provides a general model reduction procedure, that is efficient – of complexity linear in the description of the rule-set, and automatic – it applies to any welldefined rule-based program.

Combinatorial Complexity and Compositional Drift in Protein Interaction Networks

This work brings to light a fundamental problem (the control of compositional drift) that must be solved by mechanisms of assembly in the context of large networks in cases where drift is not (or cannot be) completely controlled by the cell, and could constitute a novel source of phenotypic heterogeneity in cell populations.

Lumpability abstractions of rule-based systems

This paper proves that a proposed quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics yields a sufficient condition for weak lumpability.

Intrinsic information carriers in combinatorial dynamical systems.

Fragments are endogenous distinctions that matter for the dynamics of a system, which warrants viewing them as the carriers of information, and are presented as a mathematical specification of fragments, but not an algorithmic implementation.

Exact Hybrid Particle/Population Simulation of Rule-Based Models of Biochemical Systems

A hybrid particle/population simulation method that combines the best attributes of both the network-based and network-free approaches is presented, taking as input a rule-based model and a user-specified subset of species to treat as population variables rather than as particles.

Rule-based modeling of signal transduction: a primer.

A self-contained tutorial on modeling signal transduction networks using the BNG Language and related software tools and shows how biochemical knowledge can be articulated using reaction rules, which can be used to capture a broad range of biochemical and biophysical phenomena in a concise and modular way.

Formal computational framework for the study of molecular evolution

This thesis develops a process-algebraic approach to the study of evolution of biochemical systems using the continuous π-calculus (cπ), a novel process algebra based on the classical π -calculus of Milner et.

Rule‐based modeling: a computational approach for studying biomolecular site dynamics in cell signaling systems

A rule‐based model comprises a set of rules, which can be processed by general‐purpose simulation and analysis tools to achieve different objectives (e.g., to perform either a deterministic or stochastic simulation).



Rules for Modeling Signal-Transduction Systems

Approaches to creation of mathematical models of signaling systems with strategies that keep the models from being unwieldy but still allow them to accurately reflect biological systems are reviewed.

A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks

The method presented here provides a rigorous way to model a large class of signaling networks using macro-states (macroscopic quantities such as the levels of occupancy of the binding domains) instead of micro- states (concentrations of individual species).

Domain-oriented reduction of rule-based network models.

A method for automating domain-oriented model reduction and its implementation as a module in the BioNetGen modelling package is described, which confirmed its ability to reduce the model size and simulation cost by at least one or two orders of magnitude.

Combinatorial complexity and dynamical restriction of network flows in signal transduction.

The relative importance of molecular species that can be generated during signalling, chemical transitions among these species, and reaction paths that lead to activation of the protein tyrosine kinase (PTK) Syk.RI is determined.

Automatic generation of cellular reaction networks with Moleculizer 1.0

This work describes an approach to the exact stochastic simulation of biochemical networks that emphasizes the contribution of protein complexes to these systems and generates much smaller reaction networks, which can be exported to other simulators for further analysis.

Formal molecular biology

Abstract Interpretation of Cellular Signalling Networks

This paper proposes a method to enumerate a superset of the reachable complexes that a κ rule set can generate and concludes by showing that a substantial rule set modelling the EGF receptor pathway verifies that syntactic condition (up to suitable transformations), and therefore despite its apparent complexity has a rather simple set of reachables.

Exact model reduction of combinatorial reaction networks

This work provides techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization and discusses a new modeling approach that allows the direct generation of exactly reduced model structures.

Signaling through receptors and scaffolds: independent interactions reduce combinatorial complexity.

This analysis dissects a highly branched network into interacting pathways originated by protein complexes assembled on different sites of receptors and scaffolds and specifies when the temporal dynamics of any given microstate can be expressed using the product of the relative concentrations of individual sites.