Pasar al contenido principal

BIOLOGIA SINTETICA PARA LA MEJORA DE BIOPROCESOS: DISEÑO, OPTIMIZACION, MONITORIZACION Y CONTROL

DPI2014-55276-C5-2-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2014
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 27
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Enabling network inference methods to handle missing data and outliers

  • Folch-Fortuny, Abel
  • Fernández Villaverde, Alejandro
  • Rodríguez Banga, Julio
  • Ferrer, Alberto|||0000-0001-7244-5947
[EN] Background: The inference of complex networks from data is a challenging problem in biological sciences, as well as in a wide range of disciplines such as chemistry, technology, economics, or sociology. The quantity and quality of the data greatly affect the results. While many methodologies have been developed for this task, they seldom take into account issues such as missing data or outlier detection and correction, which need to be properly addressed before network inference. Results: Here we present an approach to (i) handle missing data and (ii) detect and correct outliers based on multivariate projection to latent structures. The method, called trimmed scores regression (TSR), enables network inference methods to analyse incomplete datasets by imputing the missing values coherently with the latent data structure. Furthermore, it substitutes the faulty values in a dataset by proper estimations. We provide an implementation of this approach, and show how it can be integrated with any network inference method as a preliminary data curation step. This functionality is demonstrated with a state of the art network inference method based on mutual information distance and entropy reduction, MIDER. Conclusion: The methodology presented here enables network inference methods to analyse a large number of incomplete and faulty datasets that could not be reliably analysed so far. Our comparative studies show the superiority of TSR over other missing data approaches used by practitioners. Furthermore, the method allows for outlier detection and correction., Research in this study was partially supported by the European Union through project BioPreDyn (FP7-KBBE 289434), and the Spanish Ministry of Science and Innovation and FEDER funds from the European Union through grants MultiScales (DPI2011-28112-C04-02, DPI2011-28112-C04-03), and SynBioFactory (DPI2014-55276-C5-1-R, DPI2014-55276-C5-2-R). AF Villaverde also acknowledges funding from the Xunta de Galicia through an I2C postdoctoral fellowship (I2C ED481B 2014/133-0). We also gratefully acknowledge Associate Professor Francisco Arteaga for his help in the adaptation of TSR to the PCA model building context.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

SELANSI: A toolbox for simulation of stochastic gene regulatory networks

  • Pájaro Diéguez, Manuel
  • Otero-Muras, Irene
  • Vázquez, Carlos
  • Alonso, Antonio
[Abstract]: Motivation Gene regulation is inherently stochastic. In many applications concerning Systems and Synthetic Biology such as the reverse engineering and the de novo design of genetic circuits, stochastic effects (yet potentially crucial) are often neglected due to the high computational cost of stochastic simulations. With advances in these fields there is an increasing need of tools providing accurate approximations of the stochastic dynamics of gene regulatory networks (GRNs) with reduced computational effort. Results This work presents SELANSI (SEmi-LAgrangian SImulation of GRNs), a software toolbox for the simulation of stochastic multidimensional gene regulatory networks. SELANSI exploits intrinsic structural properties of gene regulatory networks to accurately approximate the corresponding Chemical Master Equation with a partial integral differential equation that is solved by a semi-lagrangian method with high efficiency. Networks under consideration might involve multiple genes with self and cross regulations, in which genes can be regulated by different transcription factors. Moreover, the validity of the method is not restricted to a particular type of kinetics. The tool offers total flexibility regarding network topology, kinetics and parameterization, as well as simulation options. © The Author 2017. Published by Oxford University Press., This work has been supported by Spanish MINECO grants AGL2015-67504-C3-2-R, PIE201230E0M2 (AAA), BES-2013-063112 (MP), MTM2016-76497-R, MTM2013-47800-C2-1-P (CV) and MINECO and European Regional Development Fund DPI2014-55276-C5-2-R (IOM).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Robust and efficient parameter estimation in dynamic models of biological systems

  • Gábor, Attila
  • Banga, Julio R.
25 páginas, 10 figuras, 2 tablas.-- This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, [Background] Dynamic modelling provides a systematic framework to understand function in biological systems. Parameter estimation in nonlinear dynamic models remains a very challenging inverse problem due to its nonconvexity and ill-conditioning. Associated issues like overfitting and local solutions are usually not properly addressed in the systems biology literature despite their importance. Here we present a method for robust and efficient parameter estimation which uses two main strategies to surmount the aforementioned difficulties: (i) efficient global optimization to deal with nonconvexity, and (ii) proper regularization methods to handle ill-conditioning. In the case of regularization, we present a detailed critical comparison of methods and guidelines for properly tuning them. Further, we show how regularized estimations ensure the best trade-offs between bias and variance, reducing overfitting, and allowing the incorporation of prior knowledge in a systematic way., [Results] We illustrate the performance of the presented method with seven case studies of different nature and increasing complexity, considering several scenarios of data availability, measurement noise and prior knowledge. We show how our method ensures improved estimations with faster and more stable convergence. We also show how the calibrated models are more generalizable. Finally, we give a set of simple guidelines to apply this strategy to a wide variety of calibration problems., [Conclusions] Here we provide a parameter estimation strategy which combines efficient global optimization with a regularization scheme. This method is able to calibrate dynamic models in an efficient and robust way, effectively fighting overfitting and allowing the incorporation of prior information., We acknowledge funding from the EU FP7 projects “NICHE” (ITN Grant number 289384) and the Spanish MINECO project “SYNBIOFACTORY” (grant number DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Metabolic engineering with multi-objective optimization of kinetic models

  • Villaverde, A. F.
  • Bongard, Sophia
  • Mauch, Klaus
  • Balsa-Canto, Eva
  • Banga, Julio R.
8 páginas, 5 figuras, 1 tabla, Kinetic models have a great potential for metabolic engineering applications. They can be used for testing which genetic and regulatory modifications can increase the production of metabolites of interest, while simultaneously monitoring other key functions of the host organism. This work presents a methodology for increasing productivity in biotechnological processes exploiting dynamic models. It uses multi-objective dynamic optimization to identify the combination of targets (enzymatic modifications) and the degree of up- or down-regulation that must be performed in order to optimize a set of pre-defined performance metrics subject to process constraints. The capabilities of the approach are demonstrated on a realistic and computationally challenging application: a large-scale metabolic model of Chinese Hamster Ovary cells (CHO), which are used for antibody production in a fed-batch process. The proposed methodology manages to provide a sustained and robust growth in CHO cells, increasing productivity while simultaneously increasing biomass production, product titer, and keeping the concentrations of lactate and ammonia at low values. The approach presented here can be used for optimizing metabolic models by finding the best combination of targets and their optimal level of up/down-regulation. Furthermore, it can accommodate additional trade-offs and constraints with great flexibility, This work was supported by the EU project “BioPreDyn” (EC FP7-KBBE-2011-5, grant number 289434) and MINECO project SYNBIOFACTORY (Ref. DPI2014-55276-C5-2-R). Alejandro F Villaverde acknowledges support from the I2C postdoctoral programme funded by Xunta de Galicia (Ref. ED481B2014/133-0), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

PREMER: parallel reverse engineering of biological networks with information theory

  • Villaverde, A. F.
  • Becker, Kolja
  • Banga, Julio R.
7 páginas, 3 figuras.-- 14th International Conference, CMSB 2016, Cambridge, UK, September 21-23, 2016, Proceedings, A common approach for reverse engineering biological networks from data is to deduce the existence of interactions among nodes from information theoretic measures. Estimating these quantities in a multidimensional space is computationally demanding for large datasets. This hampers the application of elaborate algorithms – which are crucial for discarding spurious interactions and determining causal relationships – to large-scale network inference problems. To alleviate this issue we have developed PREMER, a software tool which can automatically run in parallel and sequential environments, thanks to its implementation of OpenMP directives. It recovers network topology and estimates the strength and causality of interactions using information theoretic criteria, and allowing the incorporation of prior knowledge. A preprocessing module takes care of imputing missing data and correcting outliers if needed. PREMER (https://​sites.​google.​com/​site/​premertoolbox/​) runs on Windows, Linux and OSX, it is implemented in Matlab/Octave and Fortran 90, and it does not require any commercial software, AFV acknowledges funding from the Galician government (Xunta de Galiza) through the I2C fellowship ED481B2014/133-0. KB was supported by the German Federal Ministry of Research and Education (BMBF, OncoPath consortium). JRB acknowledges funding from the Spanish government (MINECO) and the European Regional Development Fund (ERDF) through the project \SYN- BIOFACTORY" (grant number DPI2014-55276-C5-2-R). This project has received funding from the European Unions Horizon 2020 research and innovation programme under grant agreement No 686282 (CanPathPro)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On the relationship between sloppiness and identifiability

  • Chis, O.
  • Villaverde, A. F.
  • Banga, Julio R.
  • Balsa-Canto, Eva
25 páginas, 11 figuras, 2 tablas, Dynamic models of biochemical networks are often formulated as sets of non-linear ordinary differential equations, whose states are the concentrations or abundances of the network components. They typically have a large number of kinetic parameters, which must be determined by calibrating the model with experimental data. In recent years it has been suggested that dynamic systems biology models are universally sloppy, meaning that the values of some parameters can be perturbed by several orders of magnitude without causing significant changes in the model output. This observation has prompted calls for focusing on model predictions rather than on parameters. In this work we examine the concept of sloppiness, investigating its links with the long-established notions of structural and practical identifiability. By analysing a set of case studies we show that sloppiness is not equivalent to lack of identifiability, and that sloppy models can be identifiable. Thus, using sloppiness to draw conclusions about the possibility of estimating parameter values can be misleading. Instead, structural and practical identifiability analyses are better tools for assessing the confidence in parameter estimates. Furthermore, we show that, when designing new experiments to decrease parametric uncertainty, designs that optimize practical identifiability criteria are more informative than those that minimize sloppiness, This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 686282 (“CANPATHPRO”) and from the Spanish government (MINECO) and the European Regional Development Fund (ERDF) through the projects “SYNBIOFACTORY” (grant number DPI2014-55276-C5-2-R), and “IMPROWINE” (grant number AGL2015-67504-C3-2-R), No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

AMIGO2, a toolbox for dynamic modeling, optimization and control in systems biology

  • Balsa-Canto, Eva
  • Henriques, David
  • Gábor, Attila
  • Banga, Julio R.
3 páginas, 1 figura.-- This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited, Motivation: Many problems of interest in dynamic modeling and control of biological systems can be posed as non-linear optimization problems subject to algebraic and dynamic constraints. In the context of modeling, this is the case of, e.g. parameter estimation, optimal experimental design and dynamic flux balance analysis. In the context of control, model-based metabolic engineering or drug dose optimization problems can be formulated as (multi-objective) optimal control problems. Finding a solution to those problems is a very challenging task which requires advanced numerical methods. Results: This work presents the AMIGO2 toolbox: the first multiplatform software tool that automatizes the solution of all those problems, offering a suite of state-of-the-art (multi-objective) global optimizers and advanced simulation approaches, EU FP7 project NICHE [ITN grant number 289384], Spanish MINECO/ FEDER projects IMPROWINE [grant number AGL2015-67504-C3-2-R] and SYNBIOFACTORY [DPI2014-55276-C5-2-R], Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Design Principles of Biological Oscillators through Optimization: Forward and Reverse Analysis

  • Otero-Muras, Irene
  • Banga, Julio R.
26 páginas, 10 figuras, 1 tabla.-- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited, From cyanobacteria to human, sustained oscillations coordinate important biological functions. Although much has been learned concerning the sophisticated molecular mechanisms underlying biological oscillators, design principles linking structure and functional behavior are not yet fully understood. Here we explore design principles of biological oscillators from a multiobjective optimization perspective, taking into account the trade-offs between conflicting performance goals or demands. We develop a comprehensive tool for automated design of oscillators, based on multicriteria global optimization that allows two modes: (i) the automatic design (forward problem) and (ii) the inference of design principles (reverse analysis problem). From the perspective of synthetic biology, the forward mode allows the solution of design problems that mimic some of the desirable properties appearing in natural oscillators. The reverse analysis mode facilitates a systematic exploration of the design space based on Pareto optimality concepts. The method is illustrated with two case studies: the automatic design of synthetic oscillators from a library of biological parts, and the exploration of design principles in 3-gene oscillatory systems, This work was supported by MINECO (and the European Regional Development Fund) project ªSYNBIOFACTORYº (grant number DPI2014-55276-C5-2-R)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Parameter estimation in large-scale systems biology models: a parallel and self-adaptive cooperative strategy

  • Penas, David R.
  • González, Patricia
  • Egea, José A.
  • Doallo, Ramón
  • Banga, Julio R.
[Background]: The development of large-scale kinetic models is one of the current key issues in computational systems biology and bioinformatics. Here we consider the problem of parameter estimation in nonlinear dynamic models. Global optimization methods can be used to solve this type of problems but the associated computational cost is very large. Moreover, many of these methods need the tuning of a number of adjustable search parameters, requiring a number of initial exploratory runs and therefore further increasing the computation times. Here we present a novel parallel method, self-adaptive cooperative enhanced scatter search (saCeSS), to accelerate the solution of this class of problems. The method is based on the scatter search optimization metaheuristic and incorporates several key new mechanisms: (i) asynchronous cooperation between parallel processes, (ii) coarse and fine-grained parallelism, and (iii) self-tuning strategies., [Results]: The performance and robustness of saCeSS is illustrated by solving a set of challenging parameter estimation problems, including medium and large-scale kinetic models of the bacterium E. coli, bakerés yeast S. cerevisiae, the vinegar fly D. melanogaster, Chinese Hamster Ovary cells, and a generic signal transduction network. The results consistently show that saCeSS is a robust and efficient method, allowing very significant reduction of computation times with respect to several previous state of the art methods (from days to minutes, in several cases) even when only a small number of processors is used., [Conclusions]: The new parallel cooperative method presented here allows the solution of medium and large scale parameter estimation problems in reasonable computation times and with small hardware requirements. Further, the method includes self-tuning mechanisms which facilitate its use by non-experts. We believe that this new method can play a key role in the development of large-scale and even whole-cell dynamic models., This research received financial support from the Spanish Ministerio de Economía y Competitividad (and the FEDER) through the “MultiScales” project (subprojects DPI2011-28112-C04-03, DPI2011-28112-C04-04), “SYNBIOFACTORY” (DPI2014-55276-C5-2-R), TIN2013-42148-P and TIN2016- 75845-P, and from the Galician Government under the Consolidation Program of Competitive Research Units (Networks ref. R2014/041 and ref. R2016/045, and competitive reference groups GRC2013/055). DRP acknowledges financial support from the MICINN-FPI programme., We acknowledge support of the publication fee by the CSIC Open Access Publication Support Initiative through its Unit of Information Resources for Research (URICI)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Data-driven reverse engineering of signaling pathways using ensembles of dynamic models

  • Henriques, David
  • Villaverde, A. F.
  • Rocha, Miguel
  • Sáez-Rodríguez, Julio
  • Banga, Julio R.
25 páginas, 7 figuras, 2 tablas.-- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited, Despite significant efforts and remarkable progress, the inference of signaling networks from experimental data remains very challenging. The problem is particularly difficult when the objective is to obtain a dynamic model capable of predicting the effect of novel perturbations not considered during model training. The problem is ill-posed due to the nonlinear nature of these systems, the fact that only a fraction of the involved proteins and their posttranslational modifications can be measured, and limitations on the technologies used for growing cells in vitro, perturbing them, and measuring their variations. As a consequence, there is a pervasive lack of identifiability. To overcome these issues, we present a methodology called SELDOM (enSEmbLe of Dynamic lOgic-based Models), which builds an ensemble of logic-based dynamic models, trains them to experimental data, and combines their individual simulations into an ensemble prediction. It also includes a model reduction step to prune spurious interactions and mitigate overfitting. SELDOM is a data-driven method, in the sense that it does not require any prior knowledge of the system: the interaction networks that act as scaffolds for the dynamic models are inferred from data using mutual information. We have tested SELDOM on a number of experimental and in silico signal transduction case-studies, including the recent HPN-DREAM breast cancer challenge. We found that its performance is highly competitive compared to state-of-the-art methods for the purpose of recovering network topology. More importantly, the utility of SELDOM goes beyond basic network inference (i.e. uncovering static interaction networks): it builds dynamic (based on ordinary differential equation) models, which can be used for mechanistic interpretations and reliable dynamic predictions in new experimental conditions (i.e. not used in the training). For this task, SELDOM's ensemble prediction is not only consistently better than predictions from individual models, but also often outperforms the state of the art represented by the methods used in the HPN-DREAM challenge, JRB and DH acknowledge funding from the EU FP7 project NICHE (ITN Grant number 289384). JRB acknowledges funding from the Spanish MINECO project SYNBIOFACTORY (grant number DPI2014-55276-C5-2-R). AFV acknowledges funding from the Galician government (Xunta de Galiza) through the I2C postdoctoral fellowship ED481B2014/133-0. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Evaluation of parallel differential evolution implementations on MapReduce and spark

  • Teijeiro, Diego
  • Pardo, Xoán C.
  • Penas, David R.
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Global optimization problems arise in many areas of science and engineering, computational and systems biology and bioinformatics among them. Many research efforts have focused on developing parallel metaheuristics to solve them in reasonable computation times. Recently, new programming models are being proposed to deal with large scale computations on commodity clusters and Cloud resources. In this paper we investigate how parallel metaheuristics deal with these new models by the parallelization of the popular Differential Evolution algorithm using MapReduce and Spark. The performance evaluation has been carried out both in a local cluster and in the Amazon Web Services public cloud. The results obtained can be particularly useful for those interested in the potential of new Cloud programming models for parallel metaheuristic methods in general and Differential Evolution in particular, Financial support from the Spanish Government (and the FEDER) through the projects DPI2014-55276-C5-2-R, TIN2013-42148-P, and from the Galician Government under the Consolidation Program of Competitive Research Units (Network Ref. R2014/041 and Project Ref. GRC2013/055) cofunded by FEDER funds of the EU, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A parallel metaheuristic for large mixedinteger dynamic optimization problems, with applications in computational biology

  • Penas, David R.
  • Henriques, David
  • González, Patricia
  • Doallo, Ramón
  • Sáez-Rodríguez, Julio
  • Banga, Julio R.
32 páginas, 12 figuras, 6 tablas.-- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited, [Background] We consider a general class of global optimization problems dealing with nonlinear dynamic models. Although this class is relevant to many areas of science and engineering, here we are interested in applying this framework to the reverse engineering problem in computational systems biology, which yields very large mixed-integer dynamic optimization (MIDO) problems. In particular, we consider the framework of logic-based ordinary differential equations (ODEs), [Methods] We present saCeSS2, a parallel method for the solution of this class of problems. This method is based on an parallel cooperative scatter search metaheuristic, with new mechanisms of self-adaptation and specific extensions to handle large mixed-integer problems. We have paid special attention to the avoidance of convergence stagnation using adaptive cooperation strategies tailored to this class of problems., [Results] We illustrate its performance with a set of three very challenging case studies from the domain of dynamic modelling of cell signaling. The simpler case study considers a synthetic signaling pathway and has 84 continuous and 34 binary decision variables. A second case study considers the dynamic modeling of signaling in liver cancer using high-throughput data, and has 135 continuous and 109 binaries decision variables. The third case study is an extremely difficult problem related with breast cancer, involving 690 continuous and 138 binary decision variables. We report computational results obtained in different infrastructures, including a local cluster, a large supercomputer and a public cloud platform. Interestingly, the results show how the cooperation of individual parallel searches modifies the systemic properties of the sequential algorithm, achieving superlinear speedups compared to an individual search (e.g. speedups of 15 with 10 cores), and significantly improving (above a 60%) the performance with respect to a non-cooperative parallel scheme. The scalability of the method is also good (tests were performed using up to 300 cores), [Conclusions] These results demonstrate that saCeSS2 can be used to successfully reverse engineer large dynamic models of complex biological pathways. Further, these results open up new possibilities for other MIDO-based large-scale applications in the life sciences such as metabolic engineering, synthetic biology, drug scheduling, This research received financial support from the Spanish Ministerio de Economía y Competitividad (and the FEDER) through projects “SYNBIOFACTORY” (DPI2014-55276-C5-2-R) and TIN2016-75845-P (AEI/FEDER, UE), and from the Galician Government under the Consolidation Program of Competitive Research Units (Network ref. R2016/045 and competitive reference groups GRC2013/055). DRP acknowledges financial support from the MICINN-FPI programme, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Dynamical compensation and structural identifiability of biological models: Analysis, implications, and reconciliation

  • Villaverde, A. F.
  • Banga, Julio R.
18 pages, 4 figures, 1 table.-- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited, The concept of dynamical compensation has been recently introduced to describe the ability of a biological system to keep its output dynamics unchanged in the face of varying parameters. However, the original definition of dynamical compensation amounts to lack of structural identifiability. This is relevant if model parameters need to be estimated, as is often the case in biological modelling. Care should we taken when using an unidentifiable model to extract biological insight: the estimated values of structurally unidentifiable parameters are meaningless, and model predictions about unmeasured state variables can be wrong. Taking this into account, we explore alternative definitions of dynamical compensation that do not necessarily imply structural unidentifiability. Accordingly, we show different ways in which a model can be made identifiable while exhibiting dynamical compensation. Our analyses enable the use of the new concept of dynamical compensation in the context of parameter identification, and reconcile it with the desirable property of structural identifiability, This work was supported by the Spanish Ministerio de Economía y Competitividad (http:// www.mineco.gob.es/portal/site/mineco/) and the European Regional Development Fund (http://ec. europa.eu/regional_policy/en/funding/erdf/) through the project "SYNBIOFACTORY" (Grant number: DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Tesis doctoral (DoctoralThesis)

Optimization in computational systems biology via high performance computing techniques

  • Penas, David R.
258 pages, [EN] The aim of computational systems biology is to generate new knowledge and understanding about complex biological systems by combining experimental data with mathematical modeling and advanced computational techniques. The development of dynamic models (also known as reverse engineering) is one of the current key issues in this area. In recent years, research has been focused on scaling-up these kinetic models. In this context, the problem of parameter estimation (model calibration) remains a very challenging task. The complexity of the underlying models requires the use of e cient solvers to achieve adequate results in reasonable computation times. Global optimization methods are used to solve these types of problems. In particular, metaheuristics have emerged as an e cient way of solving these hard global optimization problems. However, in most realistic applications, metaheuristics still require a large computation time to obtain acceptable results. This Thesis presents the design, implementation and evaluation of novel parallel metaheuristics with the focus on parameter estimation problems in computational systems biology. In particular, we propose new cooperative metaheuristics based on the well known Di erential Evolution and Scatter Search algorithms. The design of the novel approaches aim to achieve a proper balance between exploration (global search) and exploitation (local search) abilities. We show how the cooperation between parallel searches improves the behavior of the individual optimizers, improving the quality of the obtained solutions while decreasing the time-to-solution. We also explore adaptive strategies in order to increase the robustness of the algorithms. We present encouraging results for the proposed metaheuristics considering very challenging large-scale benchmark problems. Both traditional high performance computing (HPC) parallel and distributed architectures and new cloud infrastructures have been used to evaluate the proposals., [ES] El objetivo de la biología de sistemas computacional es generar conocimiento sobre complejos sistemas biológicos mediante la combinación de datos experimentales con modelos matemáticos y técnicas avanzadas de computación. El desarrollo de modelos dinámicos (cinéticos), también conocido como ingeniería inversa, es uno de los temas clave en este campo. En los últimos años, ha surgido un gran interés en el escalado de estos modelos cinéticos, haciendo de la estimación de parámetros, también conocida como calibración de modelos, una tarea con una gran dificultad, que requiere el uso de herramientas y métodos eficientes para alcanzar buenos resultados en un tiempo razonable. En general, para resolver estos problemas se usan métodos de optimización global. En concreto, las metaheurísticas surgen como algoritmos eficientes a ser utilizado en los problemas más complejos. Sin embargo, en la mayoría de las aplicaciones reales, las metaheurísticas todavía requieren mucho tiempo de cálculo para obtener resultados aceptables. Esta tesis presenta el diseño, implementación y evaluación de nuevas metaheurísticas paralelas, especializadas sobretodo en resolver problemas de estimación de parámetros en biología de sistemas. En concreto, se proponen nuevas metaheurísticas basadas en los algoritmos de evolución diferencial y de búsqueda dispersa. Las nuevas propuestas tienen como objetivo lograr un equilibrio entre las capacidades de exploración y explotación de los algoritmos. Además, demuestran como la cooperación entre búsquedas concurrentes mejora el comportamiento del algoritmo, mejorando la calidad de las soluciones y disminuyendo el tiempo de ejecución. También se han estudiado estrategias adaptativas para aumentar la robustez de las propuestas. Para la evaluación se han usado tanto arquitecturas HPC tradicionales como nuevas infraestructuras en la nube. Se han obtenido muy buenos resultados en problemas de gran dimensión y complejidad, [GA] O obxectivo da bioloxía de sistemas computacional é xerar coñecemento sobre complexos sisteáticos e técnicas avanzadas de computación. O desenvolvemento de modelos dinámicos (cinéticos), tamén coñecidos como enxeñería inversa, é un dos temas chave nesta área. Nos últimos anos, moitas investigacións centráronse no escaladoámetros destes modelos, tamén coñecida como calibración de modelos, unha tarefa complexa. Esa complexidade require o uso de ferramentas e métodos eficientes para acadar bos resultados nun tempo cálculo razoable. En xeral, para resolver este tipo de problemas úsanse métodos de optimización global, e en particular as metaheurísticas xurdiron como métodos eficientes para resolver os problemas máis custosos. Con todo, para a maioría das aplicacións reais, as metaheurísticas aínda requiren moito tempo de cálculo para obter resultados aceptábeis. Nesta tese preséntase o deseño, implementación e avaliación de novas metaheurísticas paralelas, especializadas en resolver problemas de estimación de parámetros dentro do contexto da bioloxía de sistema. En concreto, propóñense novas metaheurísticas baseadas nos algoritmos de avaliación diferencial e de procura dispersa. As novas propostas teñen como obxectivo acadar un equilibrio entre as capacidades de exploración e explotación dos algoritmos. Ademais, demostran como a cooperación entre procuras concorrentes mellora o comportamento dos algoritmos, mellorando a calidade das solucións e diminuíndo o tempo de execución. Tamén estudáronse estratexias adaptativas para aumentar a robustez das propostas. Na avaliación usáronse tanto arquitecturas HPC tradicionais como novas infraestruturas na nube. Obtivéronse moi bos resultados con problemas de optimización de grande dimensión e complexidade, Ministerio de Economía e Competitividade, a través dos proxectos DPI2011- 28112-C04, DPI2014-55276-C5, TIN2013-42148-P e TIN2016-75845-P (todos cofinanciados con fondos FEDER), e do programa de axudas para a formación de persoal de investigación FPI (Ref: BES-2012-059201, vinculada ó proxecto DPI2011- 28112-C04); Xunta de Galicia, polas axudas para a consolidación e estruturación de unidades de investigación competitivas (Redes ref. R2014/041 e ref. R2016/045, e os Grupos de Referencia Competitiva GRC2013/055), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Multistability in a prion replication interconnected cell reaction network

  • Méndez-González, J. M.
  • Otero-Muras, Irene
2 pages, 1 tables, 2 figures, Aggregation of misfolded proteins has been implicated in a number of neurodegenerative disorders including prion disease. In spite of intensive research, the detailed mechanisms of protein misfolding leading to protein aggregation remain unsolved. Here, we explore the capacity for bistability of several classes of mechanisms proposed in the literature and compatible with protein aggregation kinetic data sets (it has been shown that bistability explains thresholds phenomena observed in protein aggregation in vitro and in vivo). Using a novel method for bistability detection we find a plausible scenario for which the so called subsequent monomer addition model leads to bistability, First author acknowledge the financial support from Red de Proteínas, Priones y Enfermedades Neurodegenerativas (PRyEND) http://www.pryend.org/ IOM Acknowledges funding from the Spanish MINECO (and the European Regional Development Fund) project SYNBIOFACTORY (grant number DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Mixed integer multiobjective optimization approaches for systems and synthetic biology

  • Otero-Muras, Irene
  • Banga, Julio R.
4 pages, 4 figures, In this work we tackle a number of computational challenges in systems and synthetic biology exploiting optimization based approaches. Our framework combines three important capabilities: multiple optimization objectives (taking into account trade-offs between conflicting goals), simultaneous exploration of topology and parameter spaces (through a mixed integer modeling framework) and high computational efficiency. We illustrate the capacities of the mixed integer multiobjective framework in three different applications: i) automated design of synthetic bistable genetic switches, ii) exloring design principles underlying biochemical bistable switches in living cells iii) advanced identification of cellular process models from experimental data, We acknowledge funding from the Spanish MINECO (and the European Regional Development Fund) project SYNBIOFACTORY (grant number DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Optimality and identification of dynamic models in systems biology: an inverse optimal control framework

  • Tsiantis, Nikolaos
  • Balsa-Canto, Eva
  • Banga, Julio R.
8 pages, 5 figures.-- A correction has been published: Bioinformatics, Volume 34, Issue 21, 01 November 2018, Page 3780, https://doi.org/10.1093/bioinformatics/bty438, Motivation Optimality principles have been used to explain many biological processes and systems. However, the functions being optimized are in general unknown a priori. Here we present an inverse optimal control framework for modeling dynamics in systems biology. The objective is to identify the underlying optimality principle from observed time-series data and simultaneously estimate unmeasured time-dependent inputs and time-invariant model parameters. As a special case, we also consider the problem of optimal simultaneous estimation of inputs and parameters from noisy data. After presenting a general statement of the inverse optimal control problem, and discussing special cases of interest, we outline numerical strategies which are scalable and robust. Results We discuss the existence, relevance and implications of identifiability issues in the above problems. We present a robust computational approach based on regularized cost functions and the use of suitable direct numerical methods based on the control-vector parameterization approach. To avoid convergence to local solutions, we make use of hybrid global-local methods. We illustrate the performance and capabilities of this approach with several challenging case studies, including simulated and real data. We pay particular attention to the computational scalability of our approach (with the objective of considering large numbers of inputs and states). We provide a software implementation of both the methods and the case studies. Availability and implementation The code used to obtain the results reported here is available at https://zenodo.org/record/1009541., This research was supported by the European Union’s Horizon 2020 research and innovation program under grant agreement No 675585 (MSCA ITN ‘SyMBioSys’) and from the Spanish MINECO/FEDER projects SYNBIOFACTORY [grant number DPI2014-55276-C5-2-R], SYNBIOCONTROL [DPI2017-82896-C2-2-R] and IMPROWINE [grant number AGL2015-67504-C3-2-R]. N.T. is a MSCA ESR at IIM-CSIC (Spain), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Benchmarking optimization methods for parameter estimation in large kinetic models

  • Villaverde, A. F.
  • Fröhlich, Fabian
  • Weindl, Daniel
  • Hasenauer, Jan
  • Banga, Julio R.
9 pages, 2 figures, 2 tables.-- This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License, [Motivation] Kinetic models contain unknown parameters that are estimated by optimizing the fit to experimental data. This task can be computationally challenging due to the presence of local optima and ill-conditioning. While a variety of optimization methods have been suggested to surmount these issues, it is difficult to choose the best one for a given problem a priori. A systematic comparison of parameter estimation methods for problems with tens to hundreds of optimization variables is currently missing, and smaller studies provided contradictory findings. [Results] We use a collection of benchmarks to evaluate the performance of two families of optimization methods: (i) multi-starts of deterministic local searches and (ii) stochastic global optimization metaheuristics; the latter may be combined with deterministic local searches, leading to hybrid methods. A fair comparison is ensured through a collaborative evaluation and a consideration of multiple performance metrics. We discuss possible evaluation criteria to assess the trade-off between computational efficiency and robustness. Our results show that, thanks to recent advances in the calculation of parametric sensitivities, a multi-start of gradient-based local methods is often a successful strategy, but a better performance can be obtained with a hybrid metaheuristic. The best performer combines a global scatter search metaheuristic with an interior point local method, provided with gradients estimated with adjoint-based sensitivities. We provide an implementation of this method to render it available to the scientific community, This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 686282 (‘CANPATHPRO’), from the Spanish MINECO/FEDER projects SYNBIOFACTORY (DPI2014-55276-C5-2-R) and SYNBIOCONTROL (DPI2017-82896-C2-2-R), and from the German Research Foundation (DFG) through the Graduate School of Quantitative Biosciences Munich (QBM; F.F.), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

SELANSI: a toolbox for simulation of stochastic gene regulatory networks

  • Pájaro Diéguez, Manuel
  • Otero-Muras, Irene
  • Vázquez, Carlos
  • Alonso, Antonio A.
3 pages, 1 figure.-- This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited, Motivation: Gene regulation is inherently stochastic. In many applications concerning Systems and Synthetic Biology such as the reverse engineering and the de novo design of genetic circuits, stochastic effects (yet potentially crucial) are often neglected due to the high computational cost of stochastic simulations. With advances in these fields there is an increasing need of tools providing accurate approximations of the stochastic dynamics of gene regulatory networks (GRNs) with reduced computational effort. Results: This work presents SELANSI (SEmi-LAgrangian SImulation of GRNs), a software toolbox for the simulation of stochastic multidimensional gene regulatory networks. SELANSI exploits intrinsic structural properties of gene regulatory networks to accurately approximate the corresponding Chemical Master Equation with a partial integral differential equation that is solved by a semi-lagrangian method with high efficiency. Networks under consideration might involve multiple genes with self and cross regulations, in which genes can be regulated by different transcription factors. Moreover, the validity of the method is not restricted to a particular type of kinetics. The tool offers total flexibility regarding network topology, kinetics and parameterization, as well as simulation options. Availability and implementation: SELANSI runs under the MATLAB environment, and is available under GPLv3 license at https://sites.google.com/view/selansi, This work has been supported by Spanish MINECO grants AGL2015-67504- C3-2-R, PIE201230E0M2 (AAA), BES-2013-063112 (MP), MTM2016- 76497-R, MTM2013-47800-C2-1-P (CV) and MINECO and European Regional Development Fund DPI2014-55276-C5-2-R (IOM), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Exploring Design Principles of Gene Regulatory Networks via Pareto Optimality

  • Otero-Muras, Irene
  • Banga, Julio R.
6 pages, 4 figures, One central problem in systems and synthetic biology is to characterize the biological functions of regulatory network motifs. Here we consider recent model-based exploration approaches used to identify motifs capable of performing a specific biological task. In this work, we propose an optimization based strategy where the motivation is twofold: on the one hand, to introduce efficiency and optimality in the search, by using global mixed integer nonlinear optimization methods. On the other hand, to incorporate multiple design objectives (Pareto optimality), in order to cope with realistic trade-offs observed in nature. The potential of this approach is illustrated through an example where we explore the design principles underlying stripe-forming motifs, We acknowledge funding from the Spanish MINECO (and the European Regional Development Fund) project SYNBIOFACTORY (grant number DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Automated Design Framework for Synthetic Biology Exploiting Pareto Optimality

  • Otero-Muras, Irene
  • Banga, Julio R.
In this work we consider Pareto optimality for automated design in synthetic biology. We present a generalized framework based on a mixed-integer dynamic optimization formulation that, given design specifications, allows the computation of Pareto optimal sets of designs, that is, the set of best trade-offs for the metrics of interest. We show how this framework can be used for (i) forward design, that is, finding the Pareto optimal set of synthetic designs for implementation, and (ii) reverse design, that is, analyzing and inferring motifs and/or design principles of gene regulatory networks from the Pareto set of optimal circuits. Finally, we illustrate the capabilities and performance of this framework considering four case studies. In the first problem we consider the forward design of an oscillator. In the remaining problems, we illustrate how to apply the reverse design approach to find motifs for stripe formation, rapid adaption, and fold-change detection, respectively, The authors acknowledge funding from Spanish MINECO (and the European Regional Development Fund) project SYNBIOFACTORY (Grant No. DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Implementing Parallel Differential Evolution on Spark

  • Teijeiro, Diego
  • Pardo, Xoán C.
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
15 pages.-- European Conference on the Applications of Evolutionary Computation, EvoApplications 2016, Metaheuristics are gaining increased attention as an efficient way of solving hard global optimization problems. Differential Evolution (DE) is one of the most popular algorithms in that class. However, its application to realistic problems results in excessive computation times. Therefore, several parallel DE schemes have been proposed, most of them focused on traditional parallel programming interfaces and infrastructures. However, with the emergence of Cloud Computing, new programming models, like Spark, have appeared to suit with large-scale data processing on clouds. In this paper we investigate the applicability of Spark to develop parallel DE schemes to be executed in a distributed environment. Both the master-slave and the island-based DE schemes usually found in the literature have been implemented using Spark. The speedup and efficiency of all the implementations were evaluated on the Amazon Web Services (AWS) public cloud, concluding that the island-based solution is the best suited to the distributed nature of Spark. It achieves a good speedup versus the serial implementation, and shows a decent scalability when the number of nodes grows, This research received financial support from the Spanish Ministerio de Economia y Competitividad (and the FEDER) through the Project SYNBIOFACTORY (grant number DPI2014-55276-C5-2-R). It has been also supported by the Spanish Ministerio de Ciencia e Innovacion (and the FEDER) through the Project TIN2013-42148-P, and by the Galician Government (Xunta de Galicia) under the Consolidation Program of Competitive Research Units (Network Ref. R2014/041 and Project Ref. GRC2013/055) cofunded by FEDER funds of the EU, No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

SYNBADm: a tool for optimization-based automated design of synthetic gene circuits

  • Otero-Muras, Irene
  • Henriques, David
  • Banga, Julio R.
3 pages, 1 figure, Motivation: The design of de novo circuits with predefined performance specifications is a challenging problem in Synthetic Biology. Computational models and tools have proved to be crucial for a successful wet lab implementation. Natural gene circuits are complex, subject to evolutionary tradeoffs and playing multiple roles. However, most synthetic designs implemented to date are simple and perform a single task. As the field progresses, advanced computational tools are needed in order to handle greater levels of circuit complexity in a more flexible way and considering multiple design criteria. Results: This works presents SYNBADm (SYNthetic Biology Automated optimal Design in Matlab), a software toolbox for the automatic optimal design of gene circuits with targeted functions from libraries of components. This tool makes use of global optimization to simultaneously search the space of structures and kinetic parameters. SYNBADm can efficiently handle high levels of circuit complexity and can consider multiple design criteria through multiobjective optimization. Further, it provides flexible design capabilities, i.e. the user can define the modeling framework, library of components and target performance function(s). Availability and Implementation: SYNBADm runs under the popular MATLAB computational environment, and is available under GPLv3 license at https://sites.google.com/site/synbadm, We acknowledge funding from the Spanish MINECO (and the European Regional Development Fund) project SYNBIOFACTORY (grant number DPI2014-55276-C5-2-R), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A cloud-based enhanced differential evolution algorithm for parameter estimation problems in computational systems biology

  • Teijeiro, Diego
  • Pardo, Xoán C.
  • Penas, David R.
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
14 pages, 6 tables, 7 figures, Metaheuristics are gaining increasing recognition in many research areas, computational systems biology among them. Recent advances in metaheuristics can be helpful in locating the vicinity of the global solution in reasonable computation times, with Differential Evolution (DE) being one of the most popular methods. However, for most realistic applications, DE still requires excessive computation times. With the advent of Cloud Computing effortless access to large number of distributed resources has become more feasible, and new distributed frameworks, like Spark, have been developed to deal with large scale computations on commodity clusters and cloud resources. In this paper we propose a parallel implementation of an enhanced DE using Spark. The proposal drastically reduces the execution time, by means of including a selected local search and exploiting the available distributed resources. The performance of the proposal has been thoroughly assessed using challenging parameter estimation problems from the domain of computational systems biology. Two different platforms have been used for the evaluation, a local cluster and the Microsoft Azure public cloud. Additionally, it has been also compared with other parallel approaches, another cloud-based solution (a MapReduce implementation) and a traditional HPC solution (a MPI implementation)., This research received financial support from the Spanish Government (and the FEDER) through the projects DPI2014-55276-C5-2-R, TIN2013-42148-P and TIN2016-75845-P, and from the Galician Government under the Consolidation Program of Competitive Research Units (Network Ref. R2016/045 and Project Ref. GRC2013/055), all of them cofunded by FEDER funds of the EU., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Stochastic modeling and numerical simulation of gene regulatory networks with protein bursting

  • Pájaro Diéguez, Manuel
  • Alonso, Antonio A.
  • Otero-Muras, Irene
  • Vázquez, Carlos
20 pages, 16 figures, 6 tables, Gene expression is inherently stochastic. Advanced single-cell microscopy techniques together with mathematical models for single gene expression led to important insights in elucidating the sources of intrinsic noise in prokaryotic and eukaryotic cells. In addition to the finite size effects due to low copy numbers, translational bursting is a dominant source of stochasticity in cell scenarios involving few short lived mRNA transcripts with high translational efficiency (as is typically the case for prokaryotes), causing protein synthesis to occur in random bursts. In the context of gene regulation cascades, the Chemical Master Equation (CME) governing gene expression has in general no closed form solution, and the accurate stochastic simulation of the dynamics of complex gene regulatory networks is a major computational challenge. The CME associated to a single gene self regulatory motif has been previously approximated by a one dimensional time dependent partial integral differential equation (PIDE). However, to the best of our knowledge, multidimensional versions for such PIDE have not been developed yet. Here we propose a multidimensional PIDE model for regulatory networks involving multiple genes with self and cross regulations (in which genes can be regulated by different transcription factors) derived as the continuous counterpart of a CME with jump process. The model offers a reliable description of systems with translational bursting. In order to provide an efficient numerical solution, we develop a semilagrangian method to discretize the differential part of the PIDE, combined with a composed trapezoidal quadrature formula to approximate the integral term. We apply the model and numerical method to study sustained stochastic oscillations and the development of competence, a particular case of transient differentiation attained by certain bacterial cells under stress conditions. We found that the resulting probability distributions are distinguishable from those characteristic of other transient differentiation processes. In this way, they can be employed as markers or signatures that identify such phenomena from bacterial population experimental data, for instance. The computational efficiency of the semilagrangian method makes it suitable for purposes like model identification and parameter estimation from experimental data or, in combination with optimization routines, the design of gene regulatory networks under molecular noise., This work has been partially supported by Ministerio de Economia y Competitividad AGL2015-67504-C3-2-R and grant PIE201230E0M2. M.P. acknowledges support from Spanish MINECO fellowship No. BES-2013-063112. C.V. has been partially supported by Spanish MINECO grants numbers MTM2016-76497-R and MTM2013-47800-C2-1-P. IOM acknowledges Spanish MINECO (and the European Regional Development Fund) grant number DPI2014-55276-C5-2-R., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Multimethod optimization in the cloud: a case-study in systems biology modelling

  • González, Patricia
  • Penas, David R.
  • Pardo, Xoán C.
  • Banga, Julio R.
  • Doallo, Ramón
12 pages, 4 figures, 4 tables, Optimization problems appear in many different applications in science and engineering. A large number of different algorithms have been proposed for solving them; however, there is no unique general optimization method that performs efficiently across a diverse set of problems. Thus, a multimethod optimization, in which different algorithms cooperate to outperform the results obtained by any of them in isolation, is a very appealing alternative. Besides, as real-life optimization problems are becoming more and more challenging, the use of HPC techniques to implement these algorithms represents an effective strategy to speed up the time-to-solution. In addition, a parallel multimethod approach can benefit from the effortless access to q large number of distributed resources facilitated by cloud computing. In this paper, we propose a self-adaptive cooperative parallel multimethod for global optimization. This proposal aims to perform a thorough exploration of the solution space by means of multiple concurrent executions of a broad range of search strategies. For its evaluation, we consider an extremely challenging case-study from the field of computational systems biology. We also assess the performance of the proposal on a public cloud, demonstrating both the potential of the multimethod approach and the opportunity that the cloud provides for these problems., This research received financial support from the Spanish Government through the projects DPI2014-55276-C5-2-R, DPI2017-82896-C2-2-R, and TIN2016-75845-P (AEI/FEDER, UE), and from the Galician Government under the Consolidation Program of Competitive Research Units (Network Ref. R2016/045 and Project Ref. ED431C 2017/04), all of them co-funded by FEDER funds of the EU., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Towards cloud-based parallel metaheuristics: a case study in computational biology with differential evolution and spark

  • Teijeiro, Diego
  • Pardo, Xoán C.
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
13 pages, 7 figures, 3 tables, Many key problems in science and engineering can be formulated and solved using global optimization techniques. In the particular case of computational biology, the development of dynamic (kinetic) models is one of the current key issues. In this context, the problem of parameter estimation (model calibration) remains as a very challenging task. The complexity of the underlying models requires the use of efficient solvers to achieve adequate results in reasonable computation times. Metaheuristics have been the focus of great consideration as an efficient way of solving hard global optimization problems. Even so, in most realistic applications, metaheuristics require a very large computation time to obtain an acceptable result. Therefore, several parallel schemes have been proposed, most of them focused on traditional parallel programming interfaces and infrastructures. However, with the emergence of cloud computing, new programming models have been proposed to deal with large-scale data processing on clouds. In this paper we explore the applicability of these new models for global optimization problems using as a case study a set of challenging parameter estimation problems in systems biology. We have developed, using Spark, an island-based parallel version of Differential Evolution. Differential Evolution is a simple population-based metaheuristic that, at the same time, is very popular for being very efficient in real function global optimization. Several experiments were conducted both on a cluster and on the Microsoft Azure public cloud to evaluate the speedup and efficiency of the proposal, concluding that the Spark implementation achieves not only competitive speedup against the serial implementation, but also good scalability when the number of nodes grows. The results can be useful for those interested in using parallel metaheuristics for global optimization problems benefiting from the potential of new cloud programming models., This was supported by the Spanish Ministerio de Economía y Competitividad (and the FEDER) through the Project SYNBIOFACTORY (Grant number DPI2014-55276-C5-2-R), by the Spanish Ministerio de Ciencia e Innovación (and the FEDER) projects TIN2013-42148-P and TIN2016-75845-P and by the Galician Government (Xunta de Galicia) under the Consolidation Program of Competitive Research Units (Network Ref. R2014/041) cofunded by FEDER funds of the EU., Peer reviewed