Spectrin properties and the elasticity of the red blood cell membrane skeleton

Two models of spectrin elasticity are developed and compared to experimental measurements of the red blood cell (RBC) membrane shear modulus through the use of an elastic finite element model of the RBC membrane skeleton. The two molecular models of spectrin are: (i) An entropic spring model of spectrin as a flexible chain. This is a model proposed by several previous authors. (ii) An elastic model of a helical coiled-coil which expands by increasing helical pitch. In previous papers, we have computed the relationship between the stiffness of a single spectrin molecule (K) and the shear modulus of a network (μ), and have shown that this behavior is strongly dependent upon network topology. For realistic network models of the RBC membrane skeleton, we equate μ to micropipette measurements of RBCs and predict K for spectrin that is consistent with the coiled-coil molecular model. The value of spectrin stiffness derived from the entropic molecular model would need to be at least 30 times greater to match the experimental results. Thus, the conclusion of this study is that a helical coiled-coil model for spectrin is more realistic than a purely entropic model.     

Systematic Construction of Kinetic Models from Genome-Scale Metabolic Networks

The quantitative effects of environmental and genetic perturbations on metabolism can be studied in silico using kinetic models. We present a strategy for large-scale model construction based on a logical layering of data such as reaction fluxes, metabolite concentrations, and kinetic constants. The resulting models contain realistic standard rate laws and plausible parameters, adhere to the laws of thermodynamics, and reproduce a predefined steady state. These features have not been simultaneously achieved by previous workflows. We demonstrate the advantages and limitations of the workflow by translating the yeast consensus metabolic network into a kinetic model. Despite crudely selected data, the model shows realistic control behaviour, a stable dynamic, and realistic response to perturbations in extracellular glucose concentrations. The paper concludes by outlining how new data can continuously be fed into the workflow and how iterative model building can assist in directing experiments.     

Identification of biochemical network modules based on shortest retroactive distances

Modularity analysis offers a route to better understand the organization of cellular biochemical networks as well as to derive practically useful, simplified models of these complex systems. While there is general agreement regarding the qualitative properties of a biochemical module, there is no clear consensus on the quantitative criteria that may be used to systematically derive these modules. In this work, we investigate cyclical interactions as the defining characteristic of a biochemical module. We utilize a round trip distance metric, termed Shortest Retroactive Distance (ShReD), to characterize the retroactive connectivity between any two reactions in a biochemical network and to group together network components that mutually influence each other. We evaluate the metric on two types of networks that feature feedback interactions: (i) epidermal growth factor receptor (EGFR) signaling and (ii) liver metabolism supporting drug transformation. For both networks, the ShReD partitions found hierarchically arranged modules that confirm biological intuition. In addition, the partitions also revealed modules that are less intuitive. In particular, ShReD-based partition of the metabolic network identified a 'redox' module that couples reactions of glucose, pyruvate, lipid and drug metabolism through shared production and consumption of NADPH. Our results suggest that retroactive interactions arising from feedback loops and metabolic cycles significantly contribute to the modularity of biochemical networks. For metabolic networks, cofactors play an important role as allosteric effectors that mediate the retroactive interactions.     

neuroConstruct: a tool for modeling networks of neurons in 3D space

Conductance-based neuronal network models can help us understand how synaptic and cellular mechanisms underlie brain function. However, these complex models are difficult to develop and are inaccessible to most neuroscientists. Moreover, even the most biologically realistic network models disregard many 3D anatomical features of the brain. Here, we describe a new software application, neuroConstruct, that facilitates the creation, visualization, and analysis of networks of multicompartmental neurons in 3D space. A graphical user interface allows model generation and modification without programming. Models within neuroConstruct are based on new simulator-independent NeuroML standards, allowing automatic generation of code for NEURON or GENESIS simulators. neuroConstruct was tested by reproducing published models and its simulator independence verified by comparing the same model on two simulators. We show how more anatomically realistic network models can be created and their properties compared with experimental measurements by extending a published 1D cerebellar granule cell layer model to 3D.     

Steady-State Kinetic Modeling Constrains Cellular Resting States and Dynamic Behavior

A defining characteristic of living cells is the ability to respond dynamically to external stimuli while maintaining homeostasis under resting conditions. Capturing both of these features in a single kinetic model is difficult because the model must be able to reproduce both behaviors using the same set of molecular components. Here, we show how combining small, well-defined steady-state networks provides an efficient means of constructing large-scale kinetic models that exhibit realistic resting and dynamic behaviors. By requiring each kinetic module to be homeostatic (at steady state under resting conditions), the method proceeds by (i) computing steady-state solutions to a system of ordinary differential equations for each module, (ii) applying principal component analysis to each set of solutions to capture the steady-state solution space of each module network, and (iii) combining optimal search directions from all modules to form a global steady-state space that is searched for accurate simulation of the time-dependent behavior of the whole system upon perturbation. Importantly, this stepwise approach retains the nonlinear rate expressions that govern each reaction in the system and enforces constraints on the range of allowable concentration states for the full-scale model. These constraints not only reduce the computational cost of fitting experimental time-series data but can also provide insight into limitations on system concentrations and architecture. To demonstrate application of the method, we show how small kinetic perturbations in a modular model of platelet P2Y₁ signaling can cause widespread compensatory effects on cellular resting states.     

From Markovian to pairwise epidemic models and the performance of moment closure approximations

Many if not all models of disease transmission on networks can be linked to the exact state-based Markovian formulation. However the large number of equations for any system of realistic size limits their applicability to small populations. As a result, most modelling work relies on simulation and pairwise models. In this paper, for a simple SIS dynamics on an arbitrary network, we formalise the link between a well known pairwise model and the exact Markovian formulation. This involves the rigorous derivation of the exact ODE model at the level of pairs in terms of the expected number of pairs and triples. The exact system is then closed using two different closures, one well established and one that has been recently proposed. A new interpretation of both closures is presented, which explains several of their previously observed properties. The closed dynamical systems are solved numerically and the results are compared to output from individual-based stochastic simulations. This is done for a range of networks with the same average degree and clustering coefficient but generated using different algorithms. It is shown that the ability of the pairwise system to accurately model an epidemic is fundamentally dependent on the underlying large-scale network structure. We show that the existing pairwise models are a good fit for certain types of network but have to be used with caution as higher-order network structures may compromise their effectiveness.     

Overview of mathematical computer models of striated sphincter muscles

The present paper compares current mathematical striated sphincter models. Current models are subdivided in four categories: (1) simple models, (2) implementations of the urethral resistance relation, (3) models with realistic muscle dynamics and (4) finite element models. In our research group a neural network model, representing Onuf's nucleus, the spinal motor nucleus that innervates the external urethral and anal sphincters, was developed. A realistic sphincter model is needed to test the neural network. To decide whether or not a model is applicable in our research two requirements should be fulfilled: (1) the presence of realistic muscle dynamics preferably by implementation of a Huxley type muscle model and (2) the model should consist of more than one muscle unit to form a more dimensional model. Reviewing the literature, if a myogenic sphincter is modelled, mainly the Hill-equation is applied. Moreover, single muscle unit models are published. In general a multi-unit muscle model of the sphincter is lacking, prohibiting the study of the inherent properties of sphincter muscles, which could give information on the realistic behaviour of elements in circular muscles. It is concluded that the functionality of current sphincter models is limited for our purpose.     

GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems

Discrete dynamical systems are used to model various realistic systems in network science, from social unrest in human populations to regulation in biological networks. A common approach is to model the agents of a system as vertices of a graph, and the pairwise interactions between agents as edges. Agents are in one of a finite set of states at each discrete time step and are assigned functions that describe how their states change based on neighborhood relations. Full characterization of state transitions of one system can give insights into fundamental behaviors of other dynamical systems. In this paper, we describe a discrete graph dynamical systems (GDSs) application called GDSCalc for computing and characterizing system dynamics. It is an open access system that is used through a web interface. We provide an overview of GDS theory. This theory is the basis of the web application; i.e., an understanding of GDS provides an understanding of the software features, while abstracting away implementation details. We present a set of illustrative examples to demonstrate its use in education and research. Finally, we compare GDSCalc with other discrete dynamical system software tools. Our perspective is that no single software tool will perform all computations that may be required by all users; tools typically have particular features that are more suitable for some tasks. We situate GDSCalc within this space of software tools.     

Comparison of Gene Regulatory Networks via Steady-State Trajectories

The modeling of genetic regulatory networks is becoming increasingly widespread in the study of biological systems. In the abstract, one would prefer quantitatively comprehensive models, such as a differential-equation model, to coarse models; however, in practice, detailed models require more accurate measurements for inference and more computational power to analyze than coarse-scale models. It is crucial to address the issue of model complexity in the framework of a basic scientific paradigm: the model should be of minimal complexity to provide the necessary predictive power. Addressing this issue requires a metric by which to compare networks. This paper proposes the use of a classical measure of difference between amplitude distributions for periodic signals to compare two networks according to the differences of their trajectories in the steady state. The metric is applicable to networks with both continuous and discrete values for both time and state, and it possesses the critical property that it allows the comparison of networks of different natures. We demonstrate application of the metric by comparing a continuous-valued reference network against simplified versions obtained via quantization.     

Population persistence in river networks

Organisms inhabiting river systems contend with downstream biased flow in a complex tree-like network. Differential equation models are often used to study population persistence, thus suggesting resolutions of the ‘drift paradox’, by considering the dependence of persistence on such variables as advection rate, dispersal characteristics, and domain size. Most previous models that explicitly considered network geometry artificially discretized river habitat into distinct patches. With the recent exception of Ramirez (J Math Biol 65:919–942, 2012), partial differential equation models have largely ignored the global geometry of river systems and the effects of tributary junctions by using intervals to describe the spatial domain. Taking advantage of recent developments in the analysis of eigenvalue problems on quantum graphs, we use a reaction–diffusion–advection equation on a metric tree graph to analyze persistence of a single population in terms of dispersal parameters and network geometry. The metric graph represents a continuous network where edges represent actual domain rather than connections among patches. Here, network geometry usually has a significant impact on persistence, and occasionally leads to dramatically altered predictions. This work ranges over such themes as model definition, reduction to a diffusion equation with the associated model features, numerical and analytical studies in radially symmetric geometries, and theoretical results for general domains. Notable in the model assumptions is that the zero-flux interior junction conditions are not restricted to conservation of hydrological discharge.     

Fast Simulation of Mechanical Heterogeneity in the Electrically Asynchronous Heart Using the MultiPatch Module

Cardiac electrical asynchrony occurs as a result of cardiac pacing or conduction disorders such as left bundle-branch block (LBBB). Electrically asynchronous activation causes myocardial contraction heterogeneity that can be detrimental for cardiac function. Computational models provide a tool for understanding pathological consequences of dyssynchronous contraction. Simulations of mechanical dyssynchrony within the heart are typically performed using the finite element method, whose computational intensity may present an obstacle to clinical deployment of patient-specific models. We present an alternative based on the CircAdapt lumped-parameter model of the heart and circulatory system, called the MultiPatch module. Cardiac walls are subdivided into an arbitrary number of patches of homogeneous tissue. Tissue properties and activation time can differ between patches. All patches within a wall share a common wall tension and curvature. Consequently, spatial location within the wall is not required to calculate deformation in a patch. We test the hypothesis that activation time is more important than tissue location for determining mechanical deformation in asynchronous hearts. We perform simulations representing an experimental study of myocardial deformation induced by ventricular pacing, and a patient with LBBB and heart failure using endocardial recordings of electrical activation, wall volumes, and end-diastolic volumes. Direct comparison between simulated and experimental strain patterns shows both qualitative and quantitative agreement between model fibre strain and experimental circumferential strain in terms of shortening and rebound stretch during ejection. Local myofibre strain in the patient simulation shows qualitative agreement with circumferential strain patterns observed in the patient using tagged MRI. We conclude that the MultiPatch module produces realistic regional deformation patterns in the asynchronous heart and that activation time is more important than tissue location within a wall for determining myocardial deformation. The CircAdapt model is therefore capable of fast and realistic simulations of dyssynchronous myocardial deformation embedded within the closed-loop cardiovascular system.     

General purpose, field-portable cell-based biosensor platform.

There are several groups of researchers developing cell-based biosensors for chemical and biological warfare agents based on electrophysiologic monitoring of cells. In order to transition such sensors from the laboratory to the field, a general-purpose hardware and software platform is required. This paper describes the design, implementation, and field-testing of such a system, consisting of cell-transport and data acquisition instruments. The cell-transport module is a self-contained, battery-powered instrument that allows various types of cell-based modules to be maintained at a preset temperature and ambient CO(2) level while in transit or in the field. The data acquisition module provides 32 channels of action potential amplification, filtering, and real-time data streaming to a laptop computer. At present, detailed analysis of the data acquired is carried out off-line, but sufficient computing power is available in the data acquisition module to enable the most useful algorithms to eventually be run real-time in the field. Both modules have sufficient internal power to permit realistic field-testing, such as the example presented in this paper.     

Using network models to approximate spatial point-process models

Spatial effects are fundamental to ecological and epidemiological systems, yet the incorporation of space into models is potentially complex. Fixed-edge network models (i.e. networks where each edge has the same fixed strength of interaction) are widely used to study spatial processes but they make simplistic assumptions about spatial scale and structure. Furthermore, it can be difficult to parameterize such models with empirical data. By comparison, spatial point-process models are often more realistic than fixed-edge network models, but are also more difficult to analyze. Here we develop a moment closure technique that allows us to define a fixed-edge network model which predicts the prevalence and rate of epidemic spread of a continuous spatial point-process epidemic model. This approach provides a systematic method for accurate parameterization of network models using data from continuously distributed populations (such as data on dispersal kernels). Insofar as point-process models are accurate representations of real spatial biological systems, our example also supports the view that network models are realistic representations of space.     

A Model of a Segmental Oscillator in the Leech Heartbeat Neuronal Network

We modeled a segmental oscillator of the timing network that paces the heartbeat of the leech. This model represents a network of six heart interneurons that comprise the basic rhythm-generating network within a single ganglion. This model builds on a previous two cell model (Nadim et al., 1995) by incorporating modifications of intrinsic and synaptic currents based on the results of a realistic waveform voltage-clamp study (Olsen and Calabrese, 1996). Due to these modifications, the new model behaves more similarly to the biological system than the previous model. For example, the slow-wave oscillation of membrane potential that underlies bursting is similar in form and amplitude to that of the biological system. Furthermore, the new model with its expanded architecture demonstrates how coordinating interneurons contribute to the oscillations within a single ganglion, in addition to their role of intersegmental coordination.     

Age-Dependent Evolution of the Yeast Protein Interaction Network Suggests a Limited Role of Gene Duplication and Divergence

Proteins interact in complex protein–protein interaction (PPI) networks whose topological properties—such as scale-free topology, hierarchical modularity, and dissortativity—have suggested models of network evolution. Currently preferred models invoke preferential attachment or gene duplication and divergence to produce networks whose topology matches that observed for real PPIs, thus supporting these as likely models for network evolution. Here, we show that the interaction density and homodimeric frequency are highly protein age–dependent in real PPI networks in a manner which does not agree with these canonical models. In light of these results, we propose an alternative stochastic model, which adds each protein sequentially to a growing network in a manner analogous to protein crystal growth (CG) in solution. The key ideas are (1) interaction probability increases with availability of unoccupied interaction surface, thus following an anti-preferential attachment rule, (2) as a network grows, highly connected sub-networks emerge into protein modules or complexes, and (3) once a new protein is committed to a module, further connections tend to be localized within that module. The CG model produces PPI networks consistent in both topology and age distributions with real PPI networks and is well supported by the spatial arrangement of protein complexes of known 3-D structure, suggesting a plausible physical mechanism for network evolution.     

A feedback quenched oscillator produces turing patterning with one diffuser

Efforts to engineer synthetic gene networks that spontaneously produce patterning in multicellular ensembles have focused on Turing's original model and the "activator-inhibitor" models of Meinhardt and Gierer. Systems based on this model are notoriously difficult to engineer. We present the first demonstration that Turing pattern formation can arise in a new family of oscillator-driven gene network topologies, specifically when a second feedback loop is introduced which quenches oscillations and incorporates a diffusible molecule. We provide an analysis of the system that predicts the range of kinetic parameters over which patterning should emerge and demonstrate the system's viability using stochastic simulations of a field of cells using realistic parameters. The primary goal of this paper is to provide a circuit architecture which can be implemented with relative ease by practitioners and which could serve as a model system for pattern generation in synthetic multicellular systems. Given the wide range of oscillatory circuits in natural systems, our system supports the tantalizing possibility that Turing pattern formation in natural multicellular systems can arise from oscillator-driven mechanisms.     

Numerical Modeling of Interstitial Fluid Flow Coupled with Blood Flow through a Remodeled Solid Tumor Microvascular Network

Modeling of interstitial fluid flow involves processes such as fluid diffusion, convective transport in extracellular matrix, and extravasation from blood vessels. To date, majority of microvascular flow modeling has been done at different levels and scales mostly on simple tumor shapes with their capillaries. However, with our proposed numerical model, more complex and realistic tumor shapes and capillary networks can be studied. Both blood flow through a capillary network, which is induced by a solid tumor, and fluid flow in tumor’s surrounding tissue are formulated. First, governing equations of angiogenesis are implemented to specify the different domains for the network and interstitium. Then, governing equations for flow modeling are introduced for different domains. The conservation laws for mass and momentum (including continuity equation, Darcy’s law for tissue, and simplified Navier–Stokes equation for blood flow through capillaries) are used for simulating interstitial and intravascular flows and Starling’s law is used for closing this system of equations and coupling the intravascular and extravascular flows. This is the first study of flow modeling in solid tumors to naturalistically couple intravascular and extravascular flow through a network. This network is generated by sprouting angiogenesis and consisting of one parent vessel connected to the network while taking into account the non-continuous behavior of blood, adaptability of capillary diameter to hemodynamics and metabolic stimuli, non-Newtonian blood flow, and phase separation of blood flow in capillary bifurcation. The incorporation of the outlined components beyond the previous models provides a more realistic prediction of interstitial fluid flow pattern in solid tumors and surrounding tissues. Results predict higher interstitial pressure, almost two times, for realistic model compared to the simplified model.     

Calculating spatial statistics for velocity jump processes with experimentally observed reorientation parameters

Mathematical modelling of the directed movement of animals, microorganisms and cells is of great relevance in the fields of biology and medicine. Simple diffusive models of movement assume a random walk in the position, while more realistic models include the direction of movement by assuming a random walk in the velocity. These velocity jump processes, although more realistic, are much harder to analyse and an equation that describes the underlying spatial distribution only exists in one dimension. In this communication we set up a realistic reorientation model in two dimensions, where the mean turning angle is dependent on the previous direction of movement and bias is implicitly introduced in the probability distribution for the direction of movement. This model, and the associated reorientation parameters, is based on data from experiments on swimming microorganisms. Assuming a transport equation to describe the motion of a population of random walkers using a velocity jump process, together with this realistic reorientation model, we use a moment closure method to derive and solve a system of equations for the spatial statistics. These asymptotic equations are a very good match to simulated random walks for realistic parameter values.