Modelling and simulating in systems biology: an approach based on multi-agent systems

Systems Biology is an innovative way of doing biology recently raised in bio-informatics contexts, characterised by the study of biological systems as complex systems with a strong focus on the system level and on the interaction dimension. In other words, the objective is to understand biological systems as a whole, putting on the foreground not only the study of the individual parts as standalone parts, but also of their interaction and of the global properties that emerge at the system level by means of the interaction among the parts. This thesis focuses on the adoption of multi-agent systems (MAS) as a suitable paradigm for Systems Biology, for developing models and simulation of complex biological systems. Multi-agent system have been recently introduced in informatics context as a suitabe paradigm for modelling and engineering complex systems. Roughly speaking, a MAS can be conceived as a set of autonomous and interacting entities, called agents, situated in some kind of nvironment, where they fruitfully interact and coordinate so as to obtain a coherent global system behaviour. The claim of this work is that the general properties of MAS make them an effective approach for modelling and building simulations of complex biological systems, following the methodological principles identified by Systems Biology. In particular, the thesis focuses on cell populations as biological systems. In order to support the claim, the thesis introduces and describes (i) a MAS-based model conceived for modelling the dynamics of systems of cells interacting inside cell environment called niches. (ii) a computational tool, developed for implementing the models and executing the simulations. The tool is meant to work as a kind of virtual laboratory, on top of which kinds of virtual experiments can be performed, characterised by the definition and execution of specific models implemented as MASs, so as to support the validation, falsification and improvement of the models through the observation and analysis of the simulations. A hematopoietic stem cell system is taken as reference case study for formulating a specific model and executing virtual experiments

FERN – a Java framework for stochastic simulation and evaluation of reaction networks

<p>Abstract</p> <p>Background</p> <p>Stochastic simulation can be used to illustrate the development of biological systems over time and the stochastic nature of these processes. Currently available programs for stochastic simulation, however, are limited in that they either a) do not provide the most efficient simulation algorithms and are difficult to extend, b) cannot be easily integrated into other applications or c) do not allow to monitor and intervene during the simulation process in an easy and intuitive way. Thus, in order to use stochastic simulation in innovative high-level modeling and analysis approaches more flexible tools are necessary.</p> <p>Results</p> <p>In this article, we present FERN (Framework for Evaluation of Reaction Networks), a Java framework for the efficient simulation of chemical reaction networks. FERN is subdivided into three layers for network representation, simulation and visualization of the simulation results each of which can be easily extended. It provides efficient and accurate state-of-the-art stochastic simulation algorithms for well-mixed chemical systems and a powerful observer system, which makes it possible to track and control the simulation progress on every level. To illustrate how FERN can be easily integrated into other systems biology applications, plugins to Cytoscape and CellDesigner are included. These plugins make it possible to run simulations and to observe the simulation progress in a reaction network in real-time from within the Cytoscape or CellDesigner environment.</p> <p>Conclusion</p> <p>FERN addresses shortcomings of currently available stochastic simulation programs in several ways. First, it provides a broad range of efficient and accurate algorithms both for exact and approximate stochastic simulation and a simple interface for extending to new algorithms. FERN's implementations are considerably faster than the C implementations of gillespie2 or the Java implementations of ISBJava. Second, it can be used in a straightforward way both as a stand-alone program and within new systems biology applications. Finally, complex scenarios requiring intervention during the simulation progress can be modelled easily with FERN.</p

Taking aim at moving targets in computational cell migration

Cell migration is central to the development and maintenance of multicellular organisms. Fundamental understanding of cell migration can, for example, direct novel therapeutic strategies to control invasive tumor cells. However, the study of cell migration yields an overabundance of experimental data that require demanding processing and analysis for results extraction. Computational methods and tools have therefore become essential in the quantification and modeling of cell migration data. We review computational approaches for the key tasks in the quantification of in vitro cell migration: image pre-processing, motion estimation and feature extraction. Moreover, we summarize the current state-of-the-art for in silico modeling of cell migration. Finally, we provide a list of available software tools for cell migration to assist researchers in choosing the most appropriate solution for their needs

In silico simulation of tumor cell proliferation and movement based on biochemical models of mapk cascade

Systems biology allows analytical investigation of intracellular dynamics, analyzing complex processes and taking into account the interactions among the various subsystems. In this study, biochemical models describing the behavior of regulatory molecular networks were created and interfaced with a simulation system able to reproduce motility and proliferation of eukaryotic cell cultures. The primary focus was on MAPK cascades, particularly Erk1/2 activation by growth factors and mitogens such as EGF through tyrosine kinase receptors (RTKs) as Egfr, which represent a fundamental signal transduction and regulatory network affecting many cellular processes, including proliferation, motility, differentiation and survival. Erk1/2 predicted levels were related to reactions representing the progression of the cell cycle and used to modulate cell growth in a cell simulator. The biochemical model was built starting from literature data and a database of estimated protein concentrations representative of different cell types and experimental conditions and may be run for prolonged time frames and in various experimental conditions, including a vast array of cell lines. A software tool developed on purpose is able to run the model and interface with the cell simulator

Dispersal modelling:integrating landscape features, behaviour and metapopulations

In human-dominated landscapes, populations and species extinctions are directly related to habitat destruction and fragmentation. To provide genetic diversity as well as population viability, individual exchanges among isolated populations must be maintained. Therefore, animal dispersal processes in fragmented landscape become an important topic for ecologists, and ecological networks planning has become one of the major challenges for landscape planners. Identification of habitat patches as well as assessment of the effect of ecological networks is badly needed. Since little information on the effect of landscape heterogeneities on animal dispersal is available, simulation models are being developed. As dispersal pattern and success strongly depend on the spatial context, species' interactions with landscapes, species behaviour and species ability to disperse, these models must be able to simulate them explicitly. This research work therefore aims first at developing methods and models that allow realistic animal dispersal simulations in fragmented landscapes. Second it aims at evaluating the effect of landscape heterogeneities and animal behaviour on dispersal and on species persistence. Additionally, the ability of such a model to estimate gene flow is analysed. To carry on this research, the following fields have been explored: landscape ecology, metapopulation dynamic, animal behaviour, genetics, Geographical Information Systems, modelling approaches and programming. A method, based on properties provided by Geographical Information Systems software, is first proposed to generate ecological networks by simulating animal dispersal according to animal movement constraints induced by human infrastructures. The resulting maps provide a spatial identification of ecological networks, corridors and conflicting areas. This model has proved to be a useful and straightforward tool for landscape planning, even if this model, similar to other present-day models used in dispersal simulations, presents numerous technical and scientific limitations. To improve models for animal dispersal, a feature-oriented landscape model associated with an expert system has been developed. Its conceptualisation, its formalism, its data structure and its object-oriented design implementation provide a very accurate representation of landscape features and simulation of complex interactions between model entities (individuals and landscape features) based on simple rules. It allows the spatial identification of simulated processes. The ability of this model to incorporate states, relations and transition rules between entities makes it applicable to simulate large ranges of dispersal processes according to specific behaviour and/or landscape uses. To analyse the influence of landscape heterogeneities and species behaviour on dispersal and their incidence on metapopulation dynamics, the proposed feature-oriented model has been coupled with an animal model. The latter assigns different cognitive and dispersal abilities to individuals. Based on simulations according to three movement strategies (corresponding to the cognitive abilities of the simulated species), two measures evaluate the effect of cognitive abilities on dispersal: the colonisation probability between habitat patches and the ecological distance (due to landscape heterogeneities). These measures give an estimation of metapopulation structures (the habitat patches belonging to the metapopulation) and metapopulation dynamics induced by the landscape heterogeneities (for example, the habitat patches which release individuals). The complexity of dispersal processes, considering species behaviours and dispersal abilities, can therefore be reproduced and analysed at different levels. This application has shown the importance of animal behaviour on metapopulation dynamics and structure. Since tracking animals and providing sufficient data remain difficult, calibration and validation procedures of dispersal models are difficult to perform. One approach proposed here is to measure one of the consequences of dispersal: genetic differentiation among populations. Geographical distances are in general used to explain a part of the genetic differentiations. But as our fundamental assumption states that landscape heterogeneities and spatial arrangements of landscape features may strongly affect dispersal successes, genetic distance between populations must be better explained by the estimate of a model which considers these factors. We have tested this assumption with the greater white-toothed shrew (Crocidura russula). Scenarios considering various behaviours and dispersal abilities of C. russula have been performed. Relating measures of genetic, geographical and ecological distances (the latter emerge from scenario simulation results) highlights the model capability to reproduce dispersal of C. russula by explaining a greater part of the genetic differentiation than that explained by the geographical distances. This application has not only pointed out the ability of the model to quantify connectivity between habitat patches but also the difficulty to relate gene dispersal and individual dispersal

Parallel optimization algorithms for high performance computing : application to thermal systems

The need of optimization is present in every field of engineering. Moreover, applications requiring a multidisciplinary approach in order to make a step forward are increasing. This leads to the need of solving complex optimization problems that exceed the capacity of human brain or intuition. A standard way of proceeding is to use evolutionary algorithms, among which genetic algorithms hold a prominent place. These are characterized by their robustness and versatility, as well as their high computational cost and low convergence speed. Many optimization packages are available under free software licenses and are representative of the current state of the art in optimization technology. However, the ability of optimization algorithms to adapt to massively parallel computers reaching satisfactory efficiency levels is still an open issue. Even packages suited for multilevel parallelism encounter difficulties when dealing with objective functions involving long and variable simulation times. This variability is common in Computational Fluid Dynamics and Heat Transfer (CFD & HT), nonlinear mechanics, etc. and is nowadays a dominant concern for large scale applications. Current research in improving the performance of evolutionary algorithms is mainly focused on developing new search algorithms. Nevertheless, there is a vast knowledge of sequential well-performing algorithmic suitable for being implemented in parallel computers. The gap to be covered is efficient parallelization. Moreover, advances in the research of both new search algorithms and efficient parallelization are additive, so that the enhancement of current state of the art optimization software can be accelerated if both fronts are tackled simultaneously. The motivation of this Doctoral Thesis is to make a step forward towards the successful integration of Optimization and High Performance Computing capabilities, which has the potential to boost technological development by providing better designs, shortening product development times and minimizing the required resources. After conducting a thorough state of the art study of the mathematical optimization techniques available to date, a generic mathematical optimization tool has been developed putting a special focus on the application of the library to the field of Computational Fluid Dynamics and Heat Transfer (CFD & HT). Then the main shortcomings of the standard parallelization strategies available for genetic algorithms and similar population-based optimization methods have been analyzed. Computational load imbalance has been identified to be the key point causing the degradation of the optimization algorithm¿s scalability (i.e. parallel efficiency) in case the average makespan of the batch of individuals is greater than the average time required by the optimizer for performing inter-processor communications. It occurs because processors are often unable to finish the evaluation of their queue of individuals simultaneously and need to be synchronized before the next batch of individuals is created. Consequently, the computational load imbalance is translated into idle time in some processors. Several load balancing algorithms have been proposed and exhaustively tested, being extendable to any other population-based optimization method that needs to synchronize all processors after the evaluation of each batch of individuals. Finally, a real-world engineering application that consists on optimizing the refrigeration system of a power electronic device has been presented as an illustrative example in which the use of the proposed load balancing algorithms is able to reduce the simulation time required by the optimization tool.El aumento de las aplicaciones que requieren de una aproximación multidisciplinar para poder avanzar se constata en todos los campos de la ingeniería, lo cual conlleva la necesidad de resolver problemas de optimización complejos que exceden la capacidad del cerebro humano o de la intuición. En estos casos es habitual el uso de algoritmos evolutivos, principalmente de los algoritmos genéticos, caracterizados por su robustez y versatilidad, así como por su gran coste computacional y baja velocidad de convergencia. La multitud de paquetes de optimización disponibles con licencias de software libre representan el estado del arte actual en tecnología de optimización. Sin embargo, la capacidad de adaptación de los algoritmos de optimización a ordenadores masivamente paralelos alcanzando niveles de eficiencia satisfactorios es todavía una tarea pendiente. Incluso los paquetes adaptados al paralelismo multinivel tienen dificultades para gestionar funciones objetivo que requieren de tiempos de simulación largos y variables. Esta variabilidad es común en la Dinámica de Fluidos Computacional y la Transferencia de Calor (CFD & HT), mecánica no lineal, etc. y es una de las principales preocupaciones en aplicaciones a gran escala a día de hoy. La investigación actual que tiene por objetivo la mejora del rendimiento de los algoritmos evolutivos está enfocada principalmente al desarrollo de nuevos algoritmos de búsqueda. Sin embargo, ya se conoce una gran variedad de algoritmos secuenciales apropiados para su implementación en ordenadores paralelos. La tarea pendiente es conseguir una paralelización eficiente. Además, los avances en la investigación de nuevos algoritmos de búsqueda y la paralelización son aditivos, por lo que el proceso de mejora del software de optimización actual se verá incrementada si se atacan ambos frentes simultáneamente. La motivación de esta Tesis Doctoral es avanzar hacia una integración completa de las capacidades de Optimización y Computación de Alto Rendimiento para así impulsar el desarrollo tecnológico proporcionando mejores diseños, acortando los tiempos de desarrollo del producto y minimizando los recursos necesarios. Tras un exhaustivo estudio del estado del arte de las técnicas de optimización matemática disponibles a día de hoy, se ha diseñado una librería de optimización orientada al campo de la Dinámica de Fluidos Computacional y la Transferencia de Calor (CFD & HT). A continuación se han analizado las principales limitaciones de las estrategias de paralelización disponibles para algoritmos genéticos y otros métodos de optimización basados en poblaciones. En el caso en que el tiempo de evaluación medio de la tanda de individuos sea mayor que el tiempo medio que necesita el optimizador para llevar a cabo comunicaciones entre procesadores, se ha detectado que la causa principal de la degradación de la escalabilidad o eficiencia paralela del algoritmo de optimización es el desequilibrio de la carga computacional. El motivo es que a menudo los procesadores no terminan de evaluar su cola de individuos simultáneamente y deben sincronizarse antes de que se cree la siguiente tanda de individuos. Por consiguiente, el desequilibrio de la carga computacional se convierte en tiempo de inactividad en algunos procesadores. Se han propuesto y testado exhaustivamente varios algoritmos de equilibrado de carga aplicables a cualquier método de optimización basado en una población que necesite sincronizar los procesadores tras cada tanda de evaluaciones. Finalmente, se ha presentado como ejemplo ilustrativo un caso real de ingeniería que consiste en optimizar el sistema de refrigeración de un dispositivo de electrónica de potencia. En él queda demostrado que el uso de los algoritmos de equilibrado de carga computacional propuestos es capaz de reducir el tiempo de simulación que necesita la herramienta de optimización

Genetic Drift Shapes the Evolution of a Highly Dynamic Metapopulation

The dynamics of extinction and (re)colonization in habitat patches are characterizing features of dynamic metapopulations, causing them to evolve differently than large, stable populations. The propagule model, which assumes genetic bottlenecks during colonization, posits that newly founded subpopulations have low genetic diversity and are genetically highly differentiated from each other. Immigration may then increase diversity and decrease differentiation between subpopulations. Thus, older and/or less isolated subpopulations are expected to have higher genetic diversity and less genetic differentiation. We tested this theory using whole-genome pool-sequencing to characterize nucleotide diversity and differentiation in 60 subpopulations of a natural metapopulation of the cyclical parthenogen Daphnia magna. For comparison, we characterized diversity in a single, large, and stable D. magna population. We found reduced (synonymous) genomic diversity, a proxy for effective population size, weak purifying selection, and low rates of adaptive evolution in the metapopulation compared with the large, stable population. These differences suggest that genetic bottlenecks during colonization reduce effective population sizes, which leads to strong genetic drift and reduced selection efficacy in the metapopulation. Consistent with the propagule model, we found lower diversity and increased differentiation in younger and also in more isolated subpopulations. Our study sheds light on the genomic consequences of extinction-(re)colonization dynamics to an unprecedented degree, giving strong support for the propagule model. We demonstrate that the metapopulation evolves differently from a large, stable population and that evolution is largely driven by genetic drift.Peer reviewe