Multi-scale stochastic organization-oriented coarse-graining exemplified on the human mitotic checkpoint

Revealing the hierarchical structure of microbial communities

Measuring the dynamics of microbial communities results in high-dimensional measurements of taxa abundances over time and space, which is difficult to analyze due to complex changes in taxonomic compositions. This paper presents a new method to investigate and visualize the intrinsic hierarchical community structure implied by the measurements. The basic idea is to identify significant intersection sets, which can be seen as sub-communities making up the measured communities. Using the subset relationship, the intersection sets together with the measurements form a hierarchical structure visualized as a Hasse diagram. Chemical organization theory (COT) is used to relate the hierarchy of the sets of taxa to potential taxa interactions and to their potential dynamical persistence. The approach is demonstrated on a data set of community data obtained from bacterial 16S rRNA gene sequencing for samples collected monthly from four groundwater wells over a nearly 3-year period (n = 114) along a hillslope area. The significance of the hierarchies derived from the data is evaluated by showing that they significantly deviate from a random model. Furthermore, it is demonstrated how the hierarchy is related to temporal and spatial factors; and how the idea of a core microbiome can be extended to a set of interrelated core microbiomes. Together the results suggest that the approach can support developing models of taxa interactions in the future.

Computing all persistent subspaces of a reaction-diffusion system

An algorithm is presented for computing a reaction-diffusion partial differential equation (PDE) system for all possible subspaces that can hold a persistent solution of the equation. For this, all possible sub-networks of the underlying reaction network that are distributed organizations (DOs) are identified. Recently it has been shown that a persistent subspace must be a DO. The algorithm computes the hierarchy of DOs starting from the largest by a linear programming approach using integer cuts. The underlying constraints use elementary reaction closures as minimal building blocks to guarantee local closedness and global self-maintenance, required for a DO. Additionally, the algorithm delivers for each subspace an affiliated set of organizational reactions and minimal compartmentalization that is necessary for this subspace to persist. It is proved that all sets of organizational reactions of a reaction network, as already DOs, form a lattice. This lattice contains all potentially persistent sets of reactions of all constrained solutions of reaction-diffusion PDEs. This provides a hierarchical structure of all persistent subspaces with regard to the species and also to the reactions of the reaction-diffusion PDE system. Here, the algorithm is described and the corresponding Python source code is provided. Furthermore, an analysis of its run time is performed and all models from the BioModels database as well as further examples are examined. Apart from the practical implications of the algorithm the results also give insights into the complexity of solving reaction-diffusion PDEs.

Counterexample Generation for Probabilistic Model Checking Micro-Scale Cyber-Physical Systems

Micro-scale Cyber-Physical Systems (MCPSs) can be automatically and formally estimated by probabilistic model checking, on the level of system model MDPs (Markov Decision Processes) against desired requirements in PCTL (Probabilistic Computation Tree Logic). The counterexamples in probabilistic model checking are witnesses of requirements violation, which can provide the meaningful information for debugging, control, and synthesis of MCPSs. Solving the smallest counterexample for probabilistic model checking MDP has been proven to be an NPC (Non-deterministic Polynomial complete) problem. Although some heuristic methods are designed for this, it is usually difficult to fix the heuristic functions. In this paper, the Genetic algorithm optimized with heuristic, i.e., the heuristic Genetic algorithm, is firstly proposed to generate a counterexample for the probabilistic model checking MDP model of MCPSs. The diagnostic subgraph serves as a compact counterexample, and diagnostic paths of MDP constitute an AND/OR tree for constructing a diagnostic subgraph. Indirect path coding of the Genetic algorithm is used to extend the search range of the state space, and a heuristic crossover operator is used to generate more effective diagnostic paths. A prototype tool based on the probabilistic model checker PAT is developed, and some cases (dynamic power management and some communication protocols) are used to illustrate its feasibility and efficiency.

Trends in mathematical modeling of host-pathogen interactions

Pathogenic microorganisms entail enormous problems for humans, livestock, and crop plants. A better understanding of the different infection strategies of the pathogens enables us to derive optimal treatments to mitigate infectious diseases or develop vaccinations preventing the occurrence of infections altogether. In this review, we highlight the current trends in mathematical modeling approaches and related methods used for understanding host-pathogen interactions. Since these interactions can be described on vastly different temporal and spatial scales as well as abstraction levels, a variety of computational and mathematical approaches are presented. Particular emphasis is placed on dynamic optimization, game theory, and spatial modeling, as they are attracting more and more interest in systems biology. Furthermore, these approaches are often combined to illuminate the complexities of the interactions between pathogens and their host. We also discuss the phenomena of molecular mimicry and crypsis as well as the interplay between defense and counter defense. As a conclusion, we provide an overview of method characteristics to assist non-experts in their decision for modeling approaches and interdisciplinary understanding.

Structure and Hierarchy of Influenza Virus Models Revealed by Reaction Network Analysis

Influenza A virus is recognized today as one of the most challenging viruses that threatens both human and animal health worldwide. Understanding the control mechanisms of influenza infection and dynamics is crucial and could result in effective future treatment strategies. Many kinetic models based on differential equations have been developed in recent decades to capture viral dynamics within a host. These models differ in their complexity in terms of number of species elements and number of reactions. Here, we present a new approach to understanding the overall structure of twelve influenza A virus infection models and their relationship to each other. To this end, we apply chemical organization theory to obtain a hierarchical decomposition of the models into chemical organizations. The decomposition is based on the model structure (reaction rules) but is independent of kinetic details such as rate constants. We found different types of model structures ranging from two to eight organizations. Furthermore, the model's organizations imply a partial order among models entailing a hierarchy of model, revealing a high model diversity with respect to their long-term behavior. Our methods and results can be helpful in model development and model integration, also beyond the influenza area.