Hybrid dynamic/static method for large-scale simulation of metabolism.
Ontology highlight
ABSTRACT: Background
Many computer studies have employed either dynamic simulation or metabolic flux analysis (MFA) to predict the behaviour of biochemical pathways. Dynamic simulation determines the time evolution of pathway properties in response to environmental changes, whereas MFA provides only a snapshot of pathway properties within a particular set of environmental conditions. However, owing to the large amount of kinetic data required for dynamic simulation, MFA, which requires less information, has been used to manipulate large-scale pathways to determine metabolic outcomes.Results
Here we describe a simulation method based on cooperation between kinetics-based dynamic models and MFA-based static models. This hybrid method enables quasi-dynamic simulations of large-scale metabolic pathways, while drastically reducing the number of kinetics assays needed for dynamic simulations. The dynamic behaviour of metabolic pathways predicted by our method is almost identical to that determined by dynamic kinetic simulation.Conclusion
The discrepancies between the dynamic and the hybrid models were sufficiently small to prove that an MFA-based static module is capable of performing dynamic simulations as accurately as kinetic models. Our hybrid method reduces the number of biochemical experiments required for dynamic models of large-scale metabolic pathways by replacing suitable enzyme reactions with a static module.
SUBMITTER: Yugi K
PROVIDER: S-EPMC1262783 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:BackgroundIn the process of constructing a dynamic model of a metabolic pathway, a large number of parameters such as kinetic constants and initial metabolite concentrations are required. However, in many cases, experimental determination of these parameters is time-consuming. Therefore, for large-scale modelling, it is essential to develop a method that requires few experimental parameters. The hybrid dynamic/static (HDS) method is a combination of the conventional kinetic representation and metabolic flux analysis (MFA). Since no kinetic information is required in the static module, which consists of MFA, the HDS method may dramatically reduce the number of required parameters. However, no adequate method for developing a hybrid model from experimental data has been proposed.ResultsIn this study, we develop a method for constructing hybrid models based on metabolome data. The method discriminates enzymes into static modules and dynamic modules using metabolite concentration time series data. Enzyme reaction rate time series were estimated from the metabolite concentration time series data and used to distinguish enzymes optimally for the dynamic and static modules. The method was applied to build hybrid models of two microbial central-carbon metabolism systems using simulation results from their dynamic models.ConclusionA protocol to build a hybrid model using metabolome data and a minimal number of kinetic parameters has been developed. The proposed method was successfully applied to the strictly regulated central-carbon metabolism system, demonstrating the practical use of the HDS method, which is designed for computer modelling of metabolic systems.
| S-EPMC1892778 | biostudies-literature
Project description:BackgroundThe biological regulatory system is highly dynamic. Correlations between functionally related genes change over different biological conditions, which are often unobserved in the data. At the gene level, the dynamic correlations result in three-way gene interactions involving a pair of genes that change correlation, and a third gene that reflects the underlying cellular conditions. This type of ternary relation can be quantified by the Liquid Association statistic. Studying these three-way interactions at the gene triplet level have revealed important regulatory mechanisms in the biological system. Currently, due to the extremely large amount of possible combinations of triplets within a high-throughput gene expression dataset, no method is available to examine the ternary relationship at the biological system level and formally address the false discovery issue.ResultsHere we propose a new method, Hypergraph for Dynamic Correlation (HDC), to construct module-level three-way interaction networks. The method is able to present integrative uniform hypergraphs to reflect the global dynamic correlation pattern in the biological system, providing guidance to down-stream gene triplet-level analyses. To validate the method's ability, we conducted two real data experiments using a melanoma RNA-seq dataset from The Cancer Genome Atlas (TCGA) and a yeast cell cycle dataset. The resulting hypergraphs are clearly biologically plausible, and suggest novel relations relevant to the biological conditions in the data.ConclusionsWe believe the new approach provides a valuable alternative method to analyze omics data that can extract higher order structures. The software is at https://github.com/yunchuankong/HypergraphDynamicCorrelation .
| S-EPMC6530038 | biostudies-literature
Project description:Massive multiple-input multiple-output (MIMO) is envisioned to offer a considerable improvement in capacity, but it has a high cost and the radio frequency (RF) chain components have a high power consumption at high frequency. To address this problem, a hybrid analog and digital precoding scheme has been studied recently, which restricts the number of RF chains to far less than the number of antenna elements. In this paper, we consider the downlink communication of a massive multiuser multiple-input single-output (MU-MISO) system and propose an iterative hybrid precoding algorithm to approach the capacity performance of the traditional full digital precoding scheme. We aim to attain a large baseband gain by zero-forcing (ZF) digital precoding on the equivalent channel and then minimize the total power to obtain the optimal RF precoder. Simulation results show that the proposed method can approach the performance of the conventional fully digital precoding with a low computational complexity.
| S-EPMC5714346 | biostudies-literature
Project description:MotivationMethods for analysis of GWAS summary statistics have encouraged data sharing and democratized the analysis of different diseases. Ideal validation for such methods is application to simulated data, where some 'truth' is known. As GWAS increase in size, so does the computational complexity of such evaluations; standard practice repeatedly simulates and analyses genotype data for all individuals in an example study.ResultsWe have developed a novel method based on an alternative approach, directly simulating GWAS summary data, without individual data as an intermediate step. We mathematically derive the expected statistics for any set of causal variants and their effect sizes, conditional upon control haplotype frequencies (available from public reference datasets). Simulation of GWAS summary output can be conducted independently of sample size by simulating random variates about these expected values. Across a range of scenarios, our method, produces very similar output to that from simulating individual genotypes with a substantial gain in speed even for modest sample sizes. Fast simulation of GWAS summary statistics will enable more complete and rapid evaluation of summary statistic methods as well as opening new potential avenues of research in fine mapping and gene set enrichment analysis.Availability and implementationOur method is available under a GPL license as an R package from http://github.com/chr1swallace/simGWAS.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6546134 | biostudies-literature
Project description:Interactions of molecules, such as signaling proteins, with multiple binding sites and/or multiple sites of post-translational covalent modification can be modeled using reaction rules. Rules comprehensively, but implicitly, define the individual chemical species and reactions that molecular interactions can potentially generate. Although rules can be automatically processed to define a biochemical reaction network, the network implied by a set of rules is often too large to generate completely or to simulate using conventional procedures. To address this problem, we present DYNSTOC, a general-purpose tool for simulating rule-based models.DYNSTOC implements a null-event algorithm for simulating chemical reactions in a homogenous reaction compartment. The simulation method does not require that a reaction network be specified explicitly in advance, but rather takes advantage of the availability of the reaction rules in a rule-based specification of a network to determine if a randomly selected set of molecular components participates in a reaction during a time step. DYNSTOC reads reaction rules written in the BioNetGen language which is useful for modeling protein-protein interactions involved in signal transduction. The method of DYNSTOC is closely related to that of StochSim. DYNSTOC differs from StochSim by allowing for model specification in terms of BNGL, which extends the range of protein complexes that can be considered in a model. DYNSTOC enables the simulation of rule-based models that cannot be simulated by conventional methods. We demonstrate the ability of DYNSTOC to simulate models accounting for multisite phosphorylation and multivalent binding processes that are characterized by large numbers of reactions.DYNSTOC is free for non-commercial use. The C source code, supporting documentation and example input files are available at http://public.tgen.org/dynstoc/.Supplementary data are available at Bioinformatics online.
| S-EPMC2660871 | biostudies-other
Project description:SummaryA MapReduce-based implementation called MR-MSPolygraph for parallelizing peptide identification from mass spectrometry data is presented. The underlying serial method, MSPolygraph, uses a novel hybrid approach to match an experimental spectrum against a combination of a protein sequence database and a spectral library. Our MapReduce implementation can run on any Hadoop cluster environment. Experimental results demonstrate that, relative to the serial version, MR-MSPolygraph reduces the time to solution from weeks to hours, for processing tens of thousands of experimental spectra. Speedup and other related performance studies are also reported on a 400-core Hadoop cluster using spectral datasets from environmental microbial communities as inputs.AvailabilityThe source code along with user documentation are available on http://compbio.eecs.wsu.edu/MR-MSPolygraph.Contactananth@eecs.wsu.edu; william.cannon@pnnl.gov.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC3198583 | biostudies-literature
Project description:BackgroundCoalescent-based species tree inference has become widely used in the analysis of genome-scale multilocus and SNP datasets when the goal is inference of a species-level phylogeny. However, numerous evolutionary processes are known to violate the assumptions of a coalescence-only model and complicate inference of the species tree. One such process is hybrid speciation, in which a species shares its ancestry with two distinct species. Although many methods have been proposed to detect hybrid speciation, only a few have considered both hybridization and coalescence in a unified framework, and these are generally limited to the setting in which putative hybrid species must be identified in advance.ResultsHere we propose a method that can examine genome-scale data for a large number of taxa and detect those taxa that may have arisen via hybridization, as well as their potential "parental" taxa. The method is based on a model that considers both coalescence and hybridization together, and uses phylogenetic invariants to construct a test that scales well in terms of computational time for both the number of taxa and the amount of sequence data. We test the method using simulated data for up 20 taxa and 100,000bp, and find that the method accurately identifies both recent and ancient hybrid species in less than 30 s. We apply the method to two empirical datasets, one composed of Sistrurus rattlesnakes for which hybrid speciation is not supported by previous work, and one consisting of several species of Heliconius butterflies for which some evidence of hybrid speciation has been previously found.ConclusionsThe proposed method is powerful for detecting hybridization for both recent and ancient hybridization events. The computations required can be carried out rapidly for a large number of sequences using genome-scale data, and the method is appropriate for both SNP and multilocus data.
| S-EPMC6543680 | biostudies-literature
Project description:SimGen is a stand-alone computer program that reads a script of commands to represent complex macromolecules, including proteins and nucleic acids, in a structural hierarchy that can then be viewed using an integral graphical viewer or animated through a high-level application programming interface in C++. Structural levels in the hierarchy range from ?-carbon or phosphate backbones through secondary structure to domains, molecules, and multimers with each level represented in an identical data structure that can be manipulated using the application programming interface. Unlike most coarse-grained simulation approaches, the higher-level objects represented in SimGen can be soft, allowing the lower-level objects that they contain to interact directly. The default motion simulated by SimGen is a Brownian-like diffusion that can be set to occur across all levels of representation in the hierarchy. Links can also be defined between objects, which, when combined with large high-level random movements, result in an effective search strategy for constraint satisfaction, including structure prediction from predicted pairwise distances. The implementation of SimGen makes use of the hierarchic data structure to avoid unnecessary calculation, especially for collision detection, allowing it to be simultaneously run and viewed on a laptop computer while simulating large systems of over 20,000 objects. It has been used previously to model complex molecular interactions including the motion of a myosin-V dimer "walking" on an actin fibre, RNA stem-loop packing, and the simulation of cell motion and aggregation. Several extensions to this original functionality are described.
| S-EPMC5282398 | biostudies-literature
Project description:A computational method is developed to carry out explicit solvent simulations of complex molecular systems under conditions of constant pH. In constant-pH simulations, preidentified ionizable sites are allowed to spontaneously protonate and deprotonate as a function of time in response to the environment and the imposed pH. The method, based on a hybrid scheme originally proposed by H. A. Stern (J. Chem. Phys. 2007, 126, 164112), consists of carrying out short nonequilibrium molecular dynamics (neMD) switching trajectories to generate physically plausible configurations with changed protonation states that are subsequently accepted or rejected according to a Metropolis Monte Carlo (MC) criterion. To ensure microscopic detailed balance arising from such nonequilibrium switches, the atomic momenta are altered according to the symmetric two-ends momentum reversal prescription. To achieve higher efficiency, the original neMD-MC scheme is separated into two steps, reducing the need for generating a large number of unproductive and costly nonequilibrium trajectories. In the first step, the protonation state of a site is randomly attributed via a Metropolis MC process on the basis of an intrinsic pKa; an attempted nonequilibrium switch is generated only if this change in protonation state is accepted. This hybrid two-step inherent pKa neMD-MC simulation method is tested with single amino acids in solution (Asp, Glu, and His) and then applied to turkey ovomucoid third domain and hen egg-white lysozyme. Because of the simple linear increase in the computational cost relative to the number of titratable sites, the present method is naturally able to treat extremely large systems.
| S-EPMC4535364 | biostudies-literature
Project description:The brain is organized into large scale spatial networks that can be detected during periods of rest using fMRI. The brain is also a dynamic organ with activity that changes over time. We developed a method and investigated properties where the connections as a function of time are derived and quantified. The point based method (PBM) presented here derives covariance matrices after clustering individual time points based upon their global spatial pattern. This method achieved increased temporal sensitivity, together with temporal network theory, allowed us to study functional integration between resting-state networks. Our results show that functional integrations between two resting-state networks predominately occurs in bursts of activity. This is followed by varying intermittent periods of less connectivity. The described point-based method of dynamic resting-state functional connectivity allows for a detailed and expanded view on the temporal dynamics of resting-state connectivity that provides novel insights into how neuronal information processing is integrated in the human brain at the level of large-scale networks.
| S-EPMC5171789 | biostudies-other