39,939 research outputs found
PEPA'd Oysters: Converting Dynamic Energy Budget Models to Bio-PEPA, illustrated by a Pacific oyster case study
We present a Bio-PEPA (Biochemical-Performance Evaluation Process Algebra) computational model for the Pacific oyster, derived from a DEB (Dynamic Energy Budget) mathematical model. Experience with this specific model allows us to propose a generic scheme for translation between the widely-used DEB theory and Bio-PEPA. The benefits of translation are that a range of novel analysis tools become available, therefore improving the potential to understand complex biological phenomena at a systems level. This work also provides a link between biology, mathematics and computer science: such interlinking of disciplines is the core of the systems approach to biology
Modeling biological systems with delays in Bio-PEPA
Delays in biological systems may be used to model events for which the
underlying dynamics cannot be precisely observed, or to provide abstraction of
some behavior of the system resulting more compact models. In this paper we
enrich the stochastic process algebra Bio-PEPA, with the possibility of
assigning delays to actions, yielding a new non-Markovian process algebra:
Bio-PEPAd. This is a conservative extension meaning that the original syntax of
Bio-PEPA is retained and the delay specification which can now be associated
with actions may be added to existing Bio-PEPA models. The semantics of the
firing of the actions with delays is the delay-as-duration approach, earlier
presented in papers on the stochastic simulation of biological systems with
delays. These semantics of the algebra are given in the Starting-Terminating
style, meaning that the state and the completion of an action are observed as
two separate events, as required by delays. Furthermore we outline how to
perform stochastic simulation of Bio-PEPAd systems and how to automatically
translate a Bio-PEPAd system into a set of Delay Differential Equations, the
deterministic framework for modeling of biological systems with delays. We end
the paper with two example models of biological systems with delays to
illustrate the approach.Comment: In Proceedings MeCBIC 2010, arXiv:1011.005
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
Background: Many biological systems are modeled qualitatively with discrete
models, such as probabilistic Boolean networks, logical models, Petri nets, and
agent-based models, with the goal to gain a better understanding of the system.
The computational complexity to analyze the complete dynamics of these models
grows exponentially in the number of variables, which impedes working with
complex models. Although there exist sophisticated algorithms to determine the
dynamics of discrete models, their implementations usually require
labor-intensive formatting of the model formulation, and they are oftentimes
not accessible to users without programming skills. Efficient analysis methods
are needed that are accessible to modelers and easy to use. Method: By
converting discrete models into algebraic models, tools from computational
algebra can be used to analyze their dynamics. Specifically, we propose a
method to identify attractors of a discrete model that is equivalent to solving
a system of polynomial equations, a long-studied problem in computer algebra.
Results: A method for efficiently identifying attractors, and the web-based
tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other
analysis methods for discrete models. ADAM converts several discrete model
types automatically into polynomial dynamical systems and analyzes their
dynamics using tools from computer algebra. Based on extensive experimentation
with both discrete models arising in systems biology and randomly generated
networks, we found that the algebraic algorithms presented in this manuscript
are fast for systems with the structure maintained by most biological systems,
namely sparseness, i.e., while the number of nodes in a biological network may
be quite large, each node is affected only by a small number of other nodes,
and robustness, i.e., small number of attractors
Process algebra modelling styles for biomolecular processes
We investigate how biomolecular processes are modelled in process algebras, focussing on chemical reactions. We consider various modelling styles and how design decisions made in the definition of the process algebra have an impact on how a modelling style can be applied. Our goal is to highlight the often implicit choices that modellers make in choosing a formalism, and illustrate, through the use of examples, how this can affect expressability as well as the type and complexity of the analysis that can be performed
COMPUTER SIMULATION AND COMPUTABILITY OF BIOLOGICAL SYSTEMS
The ability to simulate a biological organism by employing a computer is related to the
ability of the computer to calculate the behavior of such a dynamical system, or the "computability" of the system.* However, the two questions of computability and simulation are not equivalent. Since the question of computability can be given a precise answer in terms of recursive functions, automata theory and dynamical systems, it will be appropriate to consider it first. The more elusive question of adequate simulation of biological systems by a computer will be then addressed and a possible connection between the two answers given will be considered. A conjecture is formulated that suggests the possibility of employing an algebraic-topological, "quantum" computer (Baianu, 1971b)
for analogous and symbolic simulations of biological systems that may include chaotic processes that are not, in genral, either recursively or digitally computable. Depending on the biological network being modelled, such as the Human Genome/Cell Interactome or a trillion-cell Cognitive Neural Network system, the appropriate logical structure for such simulations might be either the Quantum MV-Logic (QMV) discussed in recent publications (Chiara, 2004, and references cited therein)or Lukasiewicz Logic Algebras that were shown to be isomorphic to MV-logic algebras (Georgescu et al, 2001)
Ćukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems
A novel approach to self-organizing, highly-complex systems (HCS), such as living organisms and artificial intelligent systems (AIs), is presented which is relevant to Cognition, Medical Bioinformatics and Computational Neuroscience. Quantum Automata (QAs) were defined in our previous work as generalized, probabilistic automata with quantum state spaces (Baianu, 1971). Their next-state functions operate through transitions between quantum states defined by the quantum equations of motion in the Schroedinger representation, with both initial and boundary conditions in space-time. Such quantum automata operate with a quantum logic, or Q-logic, significantly different from either Boolean or Ćukasiewicz many-valued logic. A new theorem is proposed which states that the category of quantum automata and automata--homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines) are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R)--Systems which are open, dynamic biosystem networks with defined biological relations that represent physiological functions of primordial organisms, single cells and higher organisms
Categorical Ontology of Complex Systems, Meta-Systems and Theory of Levels: The Emergence of Life, Human Consciousness and Society
Single cell interactomics in simpler organisms, as well as somatic cell interactomics in multicellular organisms, involve biomolecular interactions in complex signalling pathways that were recently represented in modular terms by quantum automata with âreversible behaviorâ representing normal cell cycling and division. Other implications of such quantum automata, modular modeling of signaling pathways and cell differentiation during development are in the fields of neural plasticity and brain development leading to quantum-weave dynamic patterns and specific molecular processes underlying extensive memory, learning, anticipation mechanisms and the emergence of human consciousness during the early brain development in children. Cell interactomics is here represented for the first time as a mixture of âclassicalâ states that determine molecular dynamics subject to Boltzmann statistics and âsteady-stateâ, metabolic (multi-stable) manifolds, together with âconfigurationâ spaces of metastable quantum states emerging from complex quantum dynamics of interacting networks of biomolecules, such as proteins and nucleic acids that are now collectively defined as quantum interactomics. On the other hand, the time dependent evolution over several generations of cancer cells --that are generally known to undergo frequent and extensive genetic mutations and, indeed, suffer genomic transformations at the chromosome level (such as extensive chromosomal aberrations found in many colon cancers)-- cannot be correctly represented in the âstandardâ terms of quantum automaton modules, as the normal somatic cells can. This significant difference at the cancer cell genomic level is therefore reflected in major changes in cancer cell interactomics often from one cancer cell âcycleâ to the next, and thus it requires substantial changes in the modeling strategies, mathematical tools and experimental designs aimed at understanding cancer mechanisms. Novel solutions to this important problem in carcinogenesis are proposed and experimental validation procedures are suggested. From a medical research and clinical standpoint, this approach has important consequences for addressing and preventing the development of cancer resistance to medical therapy in ongoing clinical trials involving stage III cancer patients, as well as improving the designs of future clinical trials for cancer treatments.\ud
\ud
\ud
KEYWORDS: Emergence of Life and Human Consciousness;\ud
Proteomics; Artificial Intelligence; Complex Systems Dynamics; Quantum Automata models and Quantum Interactomics; quantum-weave dynamic patterns underlying human consciousness; specific molecular processes underlying extensive memory, learning, anticipation mechanisms and human consciousness; emergence of human consciousness during the early brain development in children; Cancer cell âcyclingâ; interacting networks of proteins and nucleic acids; genetic mutations and chromosomal aberrations in cancers, such as colon cancer; development of cancer resistance to therapy; ongoing clinical trials involving stage III cancer patientsâ possible improvements of the designs for future clinical trials and cancer treatments. \ud
\u
- âŠ