Search arXiv⌕ Search

SEARCH · Search arXiv

Results for “q-bio.MN”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16Linked to original sources
arXiv2011

Reverse engineering gene regulatory networks using approximate Bayesian computation

Gene regulatory networks are collections of genes that interact with one other and with other substances in the cell. By measuring gene expression over time using high-throughput technologies, it may be possible to reverse engineer, or infer, the structure of the gene network involved in a particular cellular process. These gene expression data typically have a high dimensionality and a limited number of biological replicates and time points. Due to these issues and the complexity of biological systems, the problem of reverse engineering networks from gene expression data demands a specialized suite of statistical tools and methodologies. We propose a non-standard adaptation of a simulation-based approach known as Approximate Bayesian Computing based on Markov chain Monte Carlo sampling. This approach is particularly well suited for the inference of gene regulatory networks from longitudinal data. The performance of this approach is investigated via simulations and using longitudinal expression data from a genetic repair system in Escherichia coli.

stat.AP↗
arXiv2011

Variable elimination in chemical reaction networks with mass action kinetics

We consider chemical reaction networks taken with mass action kinetics. The steady states of such a system are solutions to a system of polynomial equations. Even for small systems the task of finding the solutions is daunting. We develop an algebraic framework and procedure for linear elimination of variables. The procedure reduces the variables in the system to a set of "core" variables by eliminating variables corresponding to a set of non-interacting species. The steady states are parameterized algebraically by the core variables, and a graphical condition is given for when a steady state with positive core variables necessarily have all variables positive. Further, we characterize graphically the sets of eliminated variables that are constrained by a conservation law and show that this conservation law takes a specific form.

math.DS↗
arXiv2011

Uncovering the hidden geometry behind metabolic networks

Metabolism is a fascinating cell machinery underlying life and disease and genome-scale reconstructions provide us with a captivating view of its complexity. However, deciphering the relationship between metabolic structure and function remains a major challenge. In particular, turning observed structural regularities into organizing principles underlying systemic functions is a crucial task that can be significantly addressed after endowing complex network representations of metabolism with the notion of geometric distance. Here, we design a cartographic map of metabolic networks by embedding them into a simple geometry that provides a natural explanation for their observed network topology and that codifies node proximity as a measure of hidden structural similarities. We assume a simple and general connectivity law that gives more probability of interaction to metabolite/reaction pairs which are closer in the hidden space. Remarkably, we find an astonishing congruency between the architecture of E. coli and human cell metabolisms and the underlying geometry. In addition, the formalism unveils a backbone-like structure of connected biochemical pathways on the basis of a quantitative cross-talk. Pathways thus acquire a new perspective which challenges their classical view as self-contained functional units.

q-bio.MN↗
arXiv2011

Concordant Chemical Reaction Networks

We describe a large class of chemical reaction networks, those endowed with a subtle structural property called concordance. We show that the class of concordant networks coincides precisely with the class of networks which, when taken with any weakly monotonic kinetics, invariably give rise to kinetic systems that are injective --- a quality that, among other things, precludes the possibility of switch-like transitions between distinct positive steady states. We also provide persistence characteristics of concordant networks, instability implications of discordance, and consequences of stronger variants of concordance. Some of our results are in the spirit of recent ones by Banaji and Craciun, but here we do not require that every species suffer a degradation reaction. This is especially important in studying biochemical networks, for which it is rare to have all species degrade.

q-bio.MN↗
arXiv2012

Inference and Characterization of Multi-Attribute Networks with Application to Computational Biology

Our work is motivated by and illustrated with application of association networks in computational biology, specifically in the context of gene/protein regulatory networks. Association networks represent systems of interacting elements, where a link between two different elements indicates a sufficient level of similarity between element attributes. While in reality relational ties between elements can be expected to be based on similarity across multiple attributes, the vast majority of work to date on association networks involves ties defined with respect to only a single attribute. We propose an approach for the inference of multi-attribute association networks from measurements on continuous attribute variables, using canonical correlation and a hypothesis-testing strategy. Within this context, we then study the impact of partial information on multi-attribute network inference and characterization, when only a subset of attributes is available. We consider in detail the case of two attributes, wherein we examine through a combination of analytical and numerical techniques the implications of the choice and number of node attributes on the ability to detect network links and, more generally, to estimate higher-level network summary statistics, such as node degree, clustering coefficients, and measures of centrality. Illustration and applications throughout the paper are developed using gene and protein expression measurements on human cancer cell lines from the NCI-60 database.

stat.AP↗
arXiv2011

Tropical geometries and dynamics of biochemical networks. Application to hybrid cell cycle models

We use the Litvinov-Maslov correspondence principle to reduce and hybridize networks of biochemical reactions. We apply this method to a cell cycle oscillator model. The reduced and hybridized model can be used as a hybrid model for the cell cycle. We also propose a practical recipe for detecting quasi-equilibrium QE reactions and quasi-steady state QSS species in biochemical models with rational rate functions and use this recipe for model reduction. Interestingly, the QE/QSS invariant manifold of the smooth model and the reduced dynamics along this manifold can be put into correspondence to the tropical variety of the hybridization and to sliding modes along this variety, respectively

q-bio.MN↗
arXiv2011

Microscopic Reversibility or Detailed Balance in Ion Channel Models

Mass action type deterministic kinetic models of ion channels are usually constructed in such a way as to obey the principle of detailed balance (or, microscopic reversibility) for two reasons: first, the authors aspire to have models harmonizing with thermodynamics, second, the conditions to ensure detailed balance reduce the number of reaction rate coefficients to be measured. We investigate a series of ion channel models which are asserted to obey detailed balance, however, these models violate mass conservation and in their case only the necessary conditions (the so-called circuit conditions) are taken into account. We show that ion channel models have a very specific structure which makes the consequences true in spite of the imprecise arguments. First, we transform the models into mass conserving ones, second, we show that the full set of conditions ensuring detailed balance (formulated by Feinberg) leads to the same relations for the reaction rate constants in these special cases, both for the original models and the transformed ones.

q-bio.MN↗
arXiv2012

Mass conserved elementary kinetics is sufficient for the existence of a non-equilibrium steady state concentration

Living systems are forced away from thermodynamic equilibrium by exchange of mass and energy with their environment. In order to model a biochemical reaction network in a non-equilibrium state one requires a mathematical formulation to mimic this forcing. We provide a general formulation to force an arbitrary large kinetic model in a manner that is still consistent with the existence of a non-equilibrium steady state. We can guarantee the existence of a non-equilibrium steady state assuming only two conditions; that every reaction is mass balanced and that continuous kinetic reaction rate laws never lead to a negative molecule concentration. These conditions can be verified in polynomial time and are flexible enough to permit one to force a system away from equilibrium. In an expository biochemical example we show how a reversible, mass balanced perpetual reaction, with thermodynamically infeasible kinetic parameters, can be used to perpetually force a kinetic model of anaerobic glycolysis in a manner consistent with the existence of a steady state. Easily testable existence conditions are foundational for efforts to reliably compute non-equilibrium steady states in genome-scale biochemical kinetic models.

q-bio.MN↗
arXiv2011

Preclusion of switch behavior in reaction networks with mass-action kinetics

We provide a Jacobian criterion that applies to arbitrary chemical reaction networks taken with mass-action kinetics to preclude the existence of multiple positive steady states within any stoichiometric class for any choice of rate constants. We are concerned with the characterization of injective networks, that is, networks for which the species formation rate function is injective in the interior of the positive orthant within each stoichiometric class. We show that a network is injective if and only if the determinant of the Jacobian of a certain function does not vanish. The function consists of components of the species formation rate function and a maximal set of independent conservation laws. The determinant of the function is a polynomial in the species concentrations and the rate constants (linear in the latter) and its coefficients are fully determined. The criterion also precludes the existence of degenerate steady states. Further, we relate injectivity of a chemical reaction network to that of the chemical reaction network obtained by adding outflow, or degradation, reactions for all species.

math.AG↗
arXiv2011

Exact Analysis of Intrinsic Qualitative Features of Phosphorelays using Mathematical Models

Phosphorelays are a class of signaling mechanisms used by cells to respond to changes in their environment. Phosphorelays (of which two-component systems constitute a special case) are particularly abundant in prokaryotes and have been shown to be involved in many fundamental processes such as stress response, osmotic regulation, virulence, and chemotaxis. We develop a general model of phosphorelays extending existing models of phosphorelays and two-component systems. We analyze the model analytically under the assumption of mass-action kinetics and prove that a phosphorelay has a unique stable steady-state. Furthermore, we derive explicit functions relating stimulus to the response in any layer of a phosphorelay and show that a limited degree of ultrasensitivity (the ability to respond to changes in stimulus in a switch-like manner) in the bottom layer of a phosphorelay is an intrinsic feature which does not depend on any reaction rates or substrate amounts. On the other hand, we show how adjusting reaction rates and substrate amounts may lead to higher degrees of ultrasensitivity in intermediate layers. The explicit formulas also enable us to prove how the response changes with alterations in stimulus, kinetic parameters, and substrate amounts. Aside from providing biological insight, the formulas may also be used to avoid time-consuming simulations in numerical analyses and simulations.

q-bio.MN↗
arXiv2011

A linear elimination framework

Key insights in molecular biology, such as enzyme kinetics, protein allostery and gene regulation emerged from quantitative analysis based on time-scale separation, allowing internal complexity to be eliminated and resulting in the well-known formulas of Michaelis-Menten, Monod-Wyman-Changeux and Ackers-Johnson-Shea. In systems biology, steady-state analysis has yielded eliminations that reveal emergent properties of multi-component networks. Here we show that these analyses of nonlinear biochemical systems are consequences of the same linear framework, consisting of a labelled, directed graph on which a Laplacian dynamics is defined, whose steady states can be algorithmically calculated. Analyses previously considered distinct are revealed as identical, while new methods of analysis become feasible.

q-bio.MN↗
arXiv2012

A Variational Approach to Parameter Estimation in Ordinary Differential Equations

Ordinary differential equations are widely-used in the field of systems biology and chemical engineering to model chemical reaction networks. Numerous techniques have been developed to estimate parameters like rate constants, initial conditions or steady state concentrations from time-resolved data. In contrast to this countable set of parameters, the estimation of entire courses of network components corresponds to an innumerable set of parameters. The approach presented in this work is able to deal with course estimation for extrinsic system inputs or intrinsic reactants, both not being constrained by the reaction network itself. Our method is based on variational calculus which is carried out analytically to derive an augmented system of differential equations including the unconstrained components as ordinary state variables. Finally, conventional parameter estimation is applied to the augmented system resulting in a combined estimation of courses and parameters. The combined estimation approach takes the uncertainty in input courses correctly into account. This leads to precise parameter estimates and correct confidence intervals. In particular this implies that small motifs of large reaction networks can be analysed independently of the rest. By the use of variational methods, elements from control theory and statistics are combined allowing for future transfer of methods between the two fields.

q-bio.MN↗
arXiv2011

Network architectural conditions for prominent and robust stochastic oscillations

Understanding relationship between noisy dynamics and biological network architecture is a fundamentally important question, particularly in order to elucidate how cells encode and process information. We analytically and numerically investigate general network architectural conditions that are necessary to generate stochastic amplified and coherent oscillations. We enumerate all possible topologies of coupled negative feedbacks in the underlying biochemical networks with three components, negative feedback loops, and mass action kinetics. Using the linear noise approximation to analytically obtain the time-dependent solution of the master equation and derive the algebraic expression of power spectra, we find that (a) all networks with coupled negative feedbacks are capable of generating stochastic amplified and coherent oscillations; (b) networks with a single negative feedback are better stochastic amplified and coherent oscillators than those with multiple coupled negative feedbacks; (c) multiple timescale difference among the kinetic rate constants is required for stochastic amplified and coherent oscillations.

q-bio.MN↗
arXiv2011

Identification of network motifs capable of frequency-tunable and robust oscillation

Oscillation has an important role in bio-dynamical systems such as circadian rhythms and eukaryotic cell cycle. John Tyson et. al. in Nature Review Mol Cell Biol 2008 examined a limited number of network topologies consisting of three nodes and four or fewer edges and identified the network design principles of biochemical oscillations. Tsai et. al. in Science 2008 studied three different network motifs, namely a negative feedback loop, coupled negative feedback loops, and coupled positive and negative feedback loops, and found that the interconnected positive and negative feedback loops are capable of generating frequency-tunable oscillations. We enumerate 249 topologically unique network architectures consisting of three nodes and at least three cyclic inhibitory edges, and identify network architectural commonalities among three functional groups: (1) most frequency-tunable yet less robust oscillators, (2) least frequency-tunable and least robust oscillators, and (3) less frequency-tunable yet most robust oscillators. We find that Frequency-tunable networks cannot simultaneously express high robustness, indicating a tradeoff between frequency tunability and robustness.

q-bio.MN↗
arXiv2012

Flexible and robust patterning by centralized gene networks

We consider networks with two types of nodes. The v-nodes, called centers, are hyperconnected and interact one to another via many u-nodes, called satellites. This centralized architecture, widespread in gene networks, realize a bow-tie scheme and possesses interesting properties. Namely, this organization creates feedback loops that are capable to generate any prescribed patterning dynamics, chaotic or periodic, and create a number of equilibrium states. We show that activation or silencing of a node can sharply switch the network attractor, even if the activated or silenced node is weakly connected. We distinguish between two dynamically different situations, "power of center" (PC) when satellite response is fast and "satellite power" (SP) when center response is fast. Using a simple network example we show that a centralized network is more robust with respect to time dependent perturbations, in the PC relative to the SP case. In theoretical molecular biology, this class of models can be used to reveal a non-trivial relation between the architecture of protein-DNA and protein-protein interaction networks and controllability of space-time dynamics of cellular processes.

q-bio.MN↗
arXiv2011

Cancer Networks: A general theoretical and computational framework for understanding cancer

We present a general computational theory of cancer and its developmental dynamics. The theory is based on a theory of the architecture and function of developmental control networks which guide the formation of multicellular organisms. Cancer networks are special cases of developmental control networks. Cancer results from transformations of normal developmental networks. Our theory generates a natural classification of all possible cancers based on their network architecture. Each cancer network has a unique topology and semantics and developmental dynamics that result in distinct clinical tumor phenotypes. We apply this new theory with a series of proof of concept cases for all the basic cancer types. These cases have been computationally modeled, their behavior simulated and mathematically described using a multicellular systems biology approach. There are fascinating correspondences between the dynamic developmental phenotype of computationally modeled {\em in silico} cancers and natural {\em in vivo} cancers. The theory lays the foundation for a new research paradigm for understanding and investigating cancer. The theory of cancer networks implies that new diagnostic methods and new treatments to cure cancer will become possible.

q-bio.MN↗