The stochastic separatrix and the reaction coordinate for complex systems.
Ontology highlight
ABSTRACT:
SUBMITTER: Antoniou D
PROVIDER: S-EPMC2719472 | biostudies-other | 2009 Apr
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Ruling out observations can lead to wrong models. This danger occurs unwillingly when one selects observations, experiments, simulations or time-series based on their outcome. In stochastic processes, conditioning on the future outcome biases all local transition probabilities and makes them consistent with the selected outcome. This circular self-consistency leads to models that are inconsistent with physical reality. It is also the reason why models built solely on macroscopic observations are prone to this fallacy.
| S-EPMC4675072 | biostudies-literature
Project description:Chemical reactions inside cells are generally considered to happen within fixed-size compartments. However, cells and their compartments are highly dynamic. Thus, such stringent geometrical assumptions may not reflect biophysical reality, and can highly bias conclusions from simulation studies. In this work, we present an intuitive algorithm for particle-based diffusion in and on moving boundaries, for both point particles and spherical particles. We first benchmark our proposed stochastic method against solutions of partial differential equations in appropriate scenarios, and further demonstrate that moving boundaries can give rise to super-diffusive motion as well as time-inhomogeneous reaction rates. Finally, we conduct a numerical experiment representing photobleaching of diffusing fluorescent proteins in dividing Saccharomyces cerevisiae cells to demonstrate that moving boundaries might cause important effects neglected in previously published studies of cell compartmentalization.
| S-EPMC4521929 | biostudies-literature
Project description:Many biochemical processes at the sub-cellular level involve a small number of molecules. The local numbers of these molecules vary in space and time, and exhibit random fluctuations that can only be captured with stochastic simulations. We present a novel stochastic operator-splitting algorithm to model such reaction-diffusion phenomena. The reaction and diffusion steps employ stochastic simulation algorithms and Brownian dynamics, respectively. Through theoretical analysis, we have developed an algorithm to identify if the system is reaction-controlled, diffusion-controlled or is in an intermediate regime. The time-step size is chosen accordingly at each step of the simulation. We have used three examples to demonstrate the accuracy and robustness of the proposed algorithm. The first example deals with diffusion of two chemical species undergoing an irreversible bimolecular reaction. It is used to validate our algorithm by comparing its results with the solution obtained from a corresponding deterministic partial differential equation at low and high number of molecules. In this example, we also compare the results from our method to those obtained using a Gillespie multi-particle (GMP) method. The second example, which models simplified RNA synthesis, is used to study the performance of our algorithm in reaction- and diffusion-controlled regimes and to investigate the effects of local inhomogeneity. The third example models reaction-diffusion of CheY molecules through the cytoplasm of Escherichia coli during chemotaxis. It is used to compare the algorithm's performance against the GMP method. Our analysis demonstrates that the proposed algorithm enables accurate simulation of the kinetics of complex and spatially heterogeneous systems. It is also computationally more efficient than commonly used alternatives, such as the GMP method.
| S-EPMC3505198 | biostudies-other
Project description:Many biochemical reaction networks are inherently multiscale in time and in the counts of participating molecular species. A standard technique to treat different time scales in the stochastic kinetics framework is averaging or quasi-steady-state analysis: it is assumed that the fast dynamics reaches its equilibrium (stationary) distribution on a time scale where the slowly varying molecular counts are unlikely to have changed. We derive analytic equilibrium distributions for various simple biochemical systems, such as enzymatic reactions and gene regulation models. These can be directly inserted into simulations of the slow time-scale dynamics. They also provide insight into the stimulus-response of these systems. An important model for which we derive the analytic equilibrium distribution is the binding of dimer transcription factors (TFs) that first have to form from monomers. This gene regulation mechanism is compared to the cases of the binding of simple monomer TFs to one gene or to multiple copies of a gene, and to the cases of the cooperative binding of two or multiple TFs to a gene. The results apply equally to ligands binding to enzyme molecules.
| S-EPMC4208355 | biostudies-literature
Project description:BackgroundGenome sequences and genome annotation data have become available at ever increasing rates in response to the rapid progress in sequencing technologies. As a consequence the demand for methods supporting comparative, evolutionary analysis is also growing. In particular, efficient tools to visualize-omics data simultaneously for multiple species are sorely lacking. A first and crucial step in this direction is the construction of a common coordinate system. Since genomes not only differ by rearrangements but also by large insertions, deletions, and duplications, the use of a single reference genome is insufficient, in particular when the number of species becomes large.ResultsThe computational problem then becomes to determine an order and orientations of optimal local alignments that are as co-linear as possible with all the genome sequences. We first review the most prominent approaches to model the problem formally and then proceed to showing that it can be phrased as a particular variant of the Betweenness Problem. It is NP hard in general. As exact solutions are beyond reach for the problem sizes of practical interest, we introduce a collection of heuristic simplifiers to resolve ordering conflicts.ConclusionBenchmarks on real-life data ranging from bacterial to fly genomes demonstrate the feasibility of computing good common coordinate systems.
| S-EPMC6151955 | biostudies-literature
Project description:Given a reaction-diffusion system interacting via a complex network, we propose two different techniques to modify the network topology while preserving its dynamical behaviour. In the region of parameters where the homogeneous solution gets spontaneously destabilized, perturbations grow along the unstable directions made available across the networks of connections, yielding irregular spatio-temporal patterns. We exploit the spectral properties of the Laplacian operator associated to the graph in order to modify its topology, while preserving the unstable manifold of the underlying equilibrium. The new network is isodynamic to the former, meaning that it reproduces the dynamical response (pattern) to a perturbation, as displayed by the original system. The first method acts directly on the eigenmodes, thus resulting in a general redistribution of link weights which, in some cases, can completely change the structure of the original network. The second method uses localization properties of the eigenvectors to identify and randomize a subnetwork that is mostly embedded only into the stable manifold. We test both techniques on different network topologies using the Ginzburg-Landau system as a reference model. Whereas the correlation between patterns on isodynamic networks generated via the first recipe is larger, the second method allows for a finer control at the level of single nodes. This work opens up a new perspective on the multiple possibilities for identifying the family of discrete supports that instigate equivalent dynamical responses on a multispecies reaction-diffusion system.
| S-EPMC6212431 | biostudies-literature
Project description:BackgroundExperiments in silico using stochastic reaction-diffusion models have emerged as an important tool in molecular systems biology. Designing computational software for such applications poses several challenges. Firstly, realistic lattice-based modeling for biological applications requires a consistent way of handling complex geometries, including curved inner- and outer boundaries. Secondly, spatiotemporal stochastic simulations are computationally expensive due to the fast time scales of individual reaction- and diffusion events when compared to the biological phenomena of actual interest. We therefore argue that simulation software needs to be both computationally efficient, employing sophisticated algorithms, yet in the same time flexible in order to meet present and future needs of increasingly complex biological modeling.ResultsWe have developed URDME, a flexible software framework for general stochastic reaction-transport modeling and simulation. URDME uses Unstructured triangular and tetrahedral meshes to resolve general geometries, and relies on the Reaction-Diffusion Master Equation formalism to model the processes under study. An interface to a mature geometry and mesh handling external software (Comsol Multiphysics) provides for a stable and interactive environment for model construction. The core simulation routines are logically separated from the model building interface and written in a low-level language for computational efficiency. The connection to the geometry handling software is realized via a Matlab interface which facilitates script computing, data management, and post-processing. For practitioners, the software therefore behaves much as an interactive Matlab toolbox. At the same time, it is possible to modify and extend URDME with newly developed simulation routines. Since the overall design effectively hides the complexity of managing the geometry and meshes, this means that newly developed methods may be tested in a realistic setting already at an early stage of development.ConclusionsIn this paper we demonstrate, in a series of examples with high relevance to the molecular systems biology community, that the proposed software framework is a useful tool for both practitioners and developers of spatial stochastic simulation algorithms. Through the combined efforts of algorithm development and improved modeling accuracy, increasingly complex biological models become feasible to study through computational methods. URDME is freely available at http://www.urdme.org.
| S-EPMC3439286 | biostudies-literature
Project description:Optical matter (OM) systems consist of (nano-)particle constituents in solution that can self-organize into ordered arrays that are bound by electrodynamic interactions. They also manifest non-conservative forces, and the motions of the nano-particles are overdamped; i.e., they exhibit diffusive trajectories. We propose a data-driven approach based on principal components analysis (PCA) to determine the collective modes of non-conservative overdamped systems, such as OM structures, and harmonic linear discriminant analysis (HLDA) of time trajectories to estimate the reaction coordinate for structural transitions. We demonstrate the approach via electrodynamics-Langevin dynamics simulations of six electrodynamically-bound nanoparticles in an incident laser beam. The reaction coordinate we discover is in excellent accord with a rigorous committor analysis, and the identified mechanism for structural isomerization is in very good agreement with the experimental observations. The PCA-HLDA approach to data-driven discovery of reaction coordinates can aid in understanding and eventually controlling non-conservative and overdamped systems including optical and active matter systems.
| S-EPMC8099877 | biostudies-literature
Project description:Task functional magnetic resonance imaging (fMRI) has been widely employed for brain activation detection and brain network analysis. Modeling rich information from spatially-organized collection of fMRI time series is challenging because of the intrinsic complexity. Hypothesis-driven methods, such as the general linear model (GLM), which regress exterior stimulus from voxel-wise functional brain activity, are limited due to overlooking the complexity of brain activities and the diversity of concurrent brain networks. Recently, sparse representation and dictionary learning methods have attracted increasing interests in task fMRI data analysis. The major advantage of this methodology is its promise in reconstructing concurrent brain networks systematically. However, this data-driven strategy is, to some extent, arbitrary and does not sufficiently utilize the prior information of task design and neuroscience knowledge. To bridge this gap, we here propose a novel supervised sparse representation and dictionary learning framework based on stochastic coordinate coding (SCC) algorithm for task fMRI data analysis, in which certain brain networks are learned with known information such as pre-defined temporal patterns and spatial network patterns, and at the same time other networks are learned automatically from data. Our proposed method has been applied to two independent task fMRI datasets, and qualitative and quantitative evaluations have shown that our method provides a new and effective framework for task fMRI data analysis.
| S-EPMC5401655 | biostudies-literature
Project description:Rare events such as genetic mutations or cell-cell interactions are important contributors to dynamics in complex biological systems, eg, in drug-resistant infections. Computational approaches can help analyze rare events that are difficult to study experimentally. However, analyzing the frequency and dynamics of rare events in computational models can also be challenging due to high computational resource demands, especially for high-fidelity stochastic computational models. To facilitate analysis of rare events in complex biological systems, we present a multifidelity analysis approach that uses medium-fidelity analysis (Monte Carlo simulations) and/or low-fidelity analysis (Markov chain models) to analyze high-fidelity stochastic model results. Medium-fidelity analysis can produce large numbers of possible rare event trajectories for a single high-fidelity model simulation. This allows prediction of both rare event dynamics and probability distributions at much lower frequencies than high-fidelity models. Low-fidelity analysis can calculate probability distributions for rare events over time for any frequency by updating the probabilities of the rare event state space after each discrete event of the high-fidelity model. To validate the approach, we apply multifidelity analysis to a high-fidelity model of tuberculosis disease. We validate the method against high-fidelity model results and illustrate the application of multifidelity analysis in predicting rare event trajectories, performing sensitivity analyses and extrapolating predictions to very low frequencies in complex systems. We believe that our approach will complement ongoing efforts to enable accurate prediction of rare event dynamics in high-fidelity computational models.
| S-EPMC6077899 | biostudies-literature