Skip to main content

Resultados relacionados

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

Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publication Artículo científico (JournalArticle)

Parameter estimation in ODEs: assessing the potential of local and global solvers

  • Fernández de Dios, M.
  • González Rueda, Ángel Manuel
  • Rodríguez Banga, Julio
  • González Díaz, Julio
  • Rodríguez Penas, David
We consider the problem of parameter estimation in dynamic systems described by ordinary differential equations. A review of the existing literature emphasizes the need for deterministic global optimization methods due to the nonconvex nature of these problems. Recent works have focused on expanding the capabilities of specialized deterministic global optimization algorithms to handle more complex problems. Despite advancements, current deterministic methods are limited to problems with a maximum of around five state and five decision variables, prompting ongoing efforts to enhance their applicability to practical problems. Our study seeks to assess the effectiveness of state-of-the-art general-purpose global and local solvers in handling realistic-sized problems efficiently, and evaluating their capabilities to cope with the nonconvex nature of the underlying estimation problems.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

An efficient ant colony optimization framework for HPC environments

  • González, Patricia
  • Osorio, Roberto R.
  • Pardo, Xoán C.
  • Banga, Julio R.
  • Doallo, Ramón
14 pages, 8 tables, 14 figures.-- Under a Creative Commons license, Combinatorial optimization problems arise in many disciplines, both in the basic sciences and in applied fields such as engineering and economics. One of the most popular combinatorial optimization methods is the Ant Colony Optimization (ACO) metaheuristic. Its parallel nature makes it especially attractive for implementation and execution in High Performance Computing (HPC) environments. Here we present a novel parallel ACO strategy making use of efficient asynchronous decentralized cooperative mechanisms. This strategy seeks to fulfill two objectives: (i) acceleration of the computations by performing the ants’ solution construction in parallel; (ii) convergence improvement through the stimulation of the diversification in the search and the cooperation between different colonies. The two main features of the proposal, decentralization and desynchronization, enable a more effective and efficient response in environments where resources are highly coupled. Examples of such infrastructures include both traditional HPC clusters, and also new distributed environments, such as cloud infrastructures, or even local computer networks. The proposal has been evaluated using the popular Traveling Salesman Problem (TSP), as a well-known NP-hard problem widely used in the literature to test combinatorial optimization methods. An exhaustive evaluation has been carried out using three medium and large size instances from the TSPLIB library, and the experiments show encouraging results with superlinear speedups compared to the sequential algorithm (e.g. speedups of 18 with 16 cores), and a very good scalability (experiments were performed with up to 384 cores improving execution time even at that scale), This work was supported by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00 / AEI/10.13039/501100011033), and by Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019–2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB-C22 (BIODYNAMICS), and from MCIN/AEI /10.13039/501100011033 and “ERDF A way of making Europe” through grant DPI2017-82896-C2-2-R (SYNBIOCONTROL), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A protocol for dynamic model calibration

  • Villaverde, A. F.
  • Pathirana, Dilan
  • Fröhlich, Fabian
  • Hasenauer, Jan
  • Banga, Julio R.
19 pages, 6 figures, 2 tables.-- This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License, Ordinary differential equation models are nowadays widely used for the mechanistic description of biological processes and their temporal evolution. These models typically have many unknown and nonmeasurable parameters, which have to be determined by fitting the model to experimental data. In order to perform this task, known as parameter estimation or model calibration, the modeller faces challenges such as poor parameter identifiability, lack of sufficiently informative experimental data and the existence of local minima in the objective function landscape. These issues tend to worsen with larger model sizes, increasing the computational complexity and the number of unknown parameters. An incorrectly calibrated model is problematic because it may result in inaccurate predictions and misleading conclusions. For nonexpert users, there are a large number of potential pitfalls. Here, we provide a protocol that guides the user through all the steps involved in the calibration of dynamic models. We illustrate the methodology with two models and provide all the code required to reproduce the results and perform the same analysis on new models. Our protocol provides practitioners and researchers in biological modelling with a one-stop guide that is at the same time compact and sufficiently comprehensive to cover all aspects of the problem, European Union’s Horizon 2020 Research and Innovation Programme (grant no. 686282) (‘CANPATHPRO’); Spanish MINECO/FEDER Project SYNBIOCONTROL (DPI2017-82896-C2-2-R to J.R.B.); Ramón y Cajal Fellowship (RYC-2019-027537-I to A.F.V.) from the Ministerio de Ciencia e innovación, Spain; Consellería de Cultura, Educación e Ordenación Universitaria, Xunta de Galicia (ED431F 2021/003 to A.F.V.); Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy (EXC 2151 - 390873048 to J.H.), (EXC-2047/1 - 390685813 to D.P.); German Federal Ministry of Economic Affairs and Energy (grant no. 16KN074236 to D.P.). Ministerio de Ciencia e Innovación, Spain (grant PID2020-117271RB-C22, ‘BIODYNAMICS’, to J.R.B.; Funding for open access charge: Universidade de Vigo/CISUG), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

OptDesign: Identifying optimum design strategies in strain engineering for biochemical production

  • Jiang, Shouyong
  • Otero-Muras, Irene
  • Banga, Julio R.
  • Wang, Yong
  • Kaiser, Markus
  • Krasnogor, Natalio
Computational tools have been widely adopted for strain optimization in metabolic engineering, contributing to numerous success stories of producing industrially relevant biochemicals. However, most of these tools focus on single metabolic intervention strategies (either gene/reaction knockout or amplification alone) and rely on hypothetical optimality principles (e.g., maximization of growth) and precise gene expression (e.g., fold changes) for phenotype prediction. This paper introduces OptDesign, a new two-step strain design strategy. In the first step, OptDesign selects regulation candidates that have a noticeable flux difference between the wild type and production strains. In the second step, it computes optimal design strategies with limited manipulations (combining regulation and knockout), leading to high biochemical production. The usefulness and capabilities of OptDesign are demonstrated for the production of three biochemicals in Escherichia coli using the latest genome-scale metabolic model iML1515, showing highly consistent results with previous studies while suggesting new manipulations to boost strain performance. The source code is available at https://github.com/chang88ye/OptDesign., This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) for funding the project “Synthetic Portabolomics: Leading the way at the crossroads of the Digital and the Bio Economies (EP/N031962/1)”. S.J. acknowledges funding from BBSRC Mitigation Fund RG16134-18. I.M.O. and J.R.B. acknowledge funding from MCIN/AEI/10.13039/501100011033 and “ERDF A way of making Europe” through grant DPI2017-82896-C2-2-R (SYNBIOCONTROL). J.R.B. acknowledges funding from MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB-C22 (BIODYNAMICS). Y.W. acknowledges funding from the National Natural Science Foundation of China (grant no. 61976225). N.K. is funded by a Royal Academy of Engineering Chair in Emerging Technology award., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Parallel ant colony optimization for the training of cell signaling networks

  • González, Patricia
  • Prado Rodríguez, Roberto
  • Gábor, Attila
  • Sáez-Rodríguez, Julio
  • Banga, Julio R.
  • Doallo, Ramón
Acquiring a functional comprehension of the deregulation of cell signaling networks in disease allows progress in the development of new therapies and drugs. Computational models are becoming increasingly popular as a systematic tool to analyze the functioning of complex biochemical networks, such as those involved in cell signaling. CellNOpt is a framework to build predictive logic-based models of signaling pathways by training a prior knowledge network to biochemical data obtained from perturbation experiments. This training can be formulated as an optimization problem that can be solved using metaheuristics. However, the genetic algorithm used so far in CellNOpt presents limitations in terms of execution time and quality of solutions when applied to large instances. Thus, in order to overcome those issues, in this paper we propose the use of a method based on ant colony optimization, adapted to the problem at hand and parallelized using a hybrid approach. The performance of this novel method is illustrated with several challenging benchmark problems in the study of new therapies for liver cancer., This work was supported by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00/AEI/10.13039/501100011033), and by Xunta de Galicia, Spain and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019–2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB-C22 (BIODYNAMICS). AG acknowledges funding from the European Union Innovative Medicines Initiative TransQST (agreement No.116030). Authors also acknowledge the Galician Supercomputing Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

AutoRepar: A method to obtain identifiable and observable reparameterizations of dynamic models with mechanistic insights

  • Massonis, Gemma
  • Banga, Julio R.
  • Villaverde, A. F.
19 pages, 6 figures.-- This is an open access article under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs License, Mechanistic dynamic models of biological systems allow for a quantitative and systematic interpretation of data and the generation of testable hypotheses. However, these models are often over-parameterized, leading to nonidentifiability and nonobservability, that is, the impossibility of inferring their parameters and state variables. The lack of structural identifiability and observability (SIO) compromises a model's ability to make predictions and provide insight. Here we present a methodology, AutoRepar, that corrects SIO deficiencies of nonlinear ODE models automatically, yielding reparameterized models that are structurally identifiable and observable. The reparameterization preserves the mechanistic meaning of selected variables, and has the exact same dynamics and input-output mapping as the original model. We implement AutoRepar as an extension of the STRIKE-GOLDD software toolbox for SIO analysis, applying it to several models from the literature to demonstrate its ability to repair their structural deficiencies. AutoRepar increases the applicability of mechanistic models, enabling them to provide reliable information about their parameters and dynamics, Consejo Superior de Investigaciones Científicas, PIE 202070E062; Consellería de Cultura, Educación e Ordenación Universitaria, Xunta de Galicia, ED431F 2021/003; MCIN/AEI, PID2020-113992RA-I00; PID2020-117271RB-C22; MCIN/AEI and ERDF A way of making Europe, DPI2017-82896-C2-2-R; MCIN/AEI and ESF Investing in your future, RYC-2019-027537-I, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Sensbio: an online server for biosensor design

  • Tellechea-Luzardo, Jonathan
  • Martín Lázaro, Hèctor
  • Moreno López, Raúl
  • Carbonell, Pablo
Allosteric transcription factor (aTF) based biosensors can be used to engineer genetic circuits for a wide range of applications. The literature and online databases contain hundreds of experimentally validated molecule-TF pairs; however, the knowledge is scattered and often incomplete. Additionally, compared to the number of compounds that can be produced in living systems, those with known associated TF-compound interactions are low. For these reasons, new tools that help researchers find new possible TF-ligand pairs are called for. In this work, we present Sensbio, a computational tool that through similarity comparison against a TF-ligand reference database, is able to identify putative transcription factors that can be activated by a given input molecule. In addition to the collection of algorithms, an online application has also been developed, together with a predictive model created to find new possible matches based on machine learning., JTL was supported by European Union MSCA (Grant agreement ID: 101062593). RML was supported by an AI2-UPV studentship. JTL and PC were supported by the Next Generation EU (NGEU) fund through the Spanish Recovery, Transformation and Resilience Plan (UNI/551/2021). PC acknowledges MCIN/AEI/https://doi.org/10.13039/501100011033 funding through PID2020-117271RB-C2 (BIODYNAMICS). PC was supported by the Spanish Ministry of Universities (UNI/551/2021), grant number UP2021-036 funded by European Union—Next generation EU. PC and HML acknowledge funding from Generalitat Valenciana through grant CIAICO/2021/159 (SmartBioFab). PC acknowledges MCIN/AEI /https://doi.org/10.13039/501100011033 and NextGenerationEU/ PRTR funding through grant TED2021-131049B-I00 (BioEcoDBTL). PC acknowledges MCIN/AEI/https://doi.org/10.13039/501100011033 funding through grant PID2021-127888NA-I00 (COMPSYNBIO)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Automated design of gene circuits with optimal mushroom-bifurcation behavior

  • Otero-Muras, Irene
  • Perez-Carrasco, Ruben
  • Banga, Julio R.
  • Barnes, Chris P.
Recent advances in synthetic biology are enabling exciting technologies, including the next generation of biosensors, the rational design of cell memory, modulated synthetic cell differentiation, and generic multifunctional biocircuits. These novel applications require the design of gene circuits leading to sophisticated behaviors and functionalities. At the same time, designs need to be kept minimal to avoid compromising cell viability. Bifurcation theory addresses such challenges by associating circuit dynamical properties with molecular details of its design. Nevertheless, incorporating bifurcation analysis into automated design processes has not been accomplished yet. This work presents an optimization-based method for the automated design of synthetic gene circuits with specified bifurcation diagrams that employ minimal network topologies. Using this approach, we designed circuits exhibiting the mushroom bifurcation, distilled the most robust topologies, and explored its multifunctional behavior. We then outline potential applications in biosensors, memory devices, and synthetic cell differentiation., I.O.M. and J.R.B. acknowledge funding from MCIN/AEI/ 10.13039/501100011033 and “ERDF A way of making Europe” through grant DPI2017-82896-C2-2-R (SYNBIOCONTROL). J.R.B. also acknowledges funding from MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB-C22 (BIODYNAMICS). I.O-M. also acknowledges MCIN/AEI/10.13039/501100011033 funding through grant PID2021-127888NA-I00 (COMPSYNBIO). R.P-C. acknowledges financial support by the UCL Mathematics Clifford Fellowship and the Department of Life Sciences at Imperial College London. C.P.B. received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant No. 770835) and from the Wellcome Trust (209409/Z/17/Z)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Improving dynamic predictions with ensembles of observable models

  • Massonis, Gemma
  • Villaverde, Alejandro F
  • Banga, Julio R.
Dynamic mechanistic modelling in systems biology has been hampered by the complexity and variability associated with the underlying interactions, and by uncertain and sparse experimental measurements. Ensemble modelling, a concept initially developed in statistical mechanics, has been introduced in biological applications with the aim of mitigating those issues. Ensemble modelling uses a collection of different models compatible with the observed data to describe the phenomena of interest. However, since systems biology models often suffer from a lack of identifiability and observability, ensembles of models are particularly unreliable when predicting non-observable states., This work was supported by BIODYNAMICS MCIN/AEI/10.13039/50110 0011033 [PID2020-117271RB-C22]; from the CSIC intramural project (MOEBIUS) [PIE 202070E062]; MCIN/AEI/10.13039/501100011033 (PREDYC TBIO) [PID2020-113992RA-I00]; Conseller ıa de Cultura, Educacio´n e Ordenacio´n Universitaria, Xunta de Galicia [ED431F 2021/003]; and MCIN/AEI/ 10.13039/501100011033 and ‘ESF Investing in your future’ [RYC-2019-027537- I]. The funding bodies played no role in the design of the study, the collection and analysis of data or in the writing of the manuscript. Funding for open access charge: Universidade de Vigo/CISUG., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Automated Design of Synthetic Gene Circuits in the Presence of Molecular Noise

  • Sequeiros Ferreiro, Carlos Xosé
  • Vázquez, Carlos
  • Banga, Julio R.
  • Otero-Muras, Irene
Microorganisms (mainly bacteria and yeast) are frequently used as hosts for genetic constructs in synthetic biology applications. Molecular noise might have a significant effect on the dynamics of gene regulation in microbial cells, mainly attributed to the low copy numbers of mRNA species involved. However, the inclusion of molecular noise in the automated design of biocircuits is not a common practice due to the computational burden linked to the chemical master equation describing the dynamics of stochastic gene regulatory circuits. Here, we address the automated design of synthetic gene circuits under the effect of molecular noise combining a mixed integer nonlinear global optimization method with a partial integro-differential equation model describing the evolution of stochastic gene regulatory systems that approximates very efficiently the chemical master equation. We demonstrate the performance of the proposed methodology through a number of examples of relevance in synthetic biology, including different bimodal stochastic gene switches, robust stochastic oscillators, and circuits capable of achieving biochemical adaptation under noise., We acknowledge the anonymous reviewers for the insightful comments, which significantly improve the manuscript. J.R.B. acknowledges financial support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033 and also from the CSIC intramural project grant PIE DAOBIO (PIE 202070E036). C.V. acknowledges funding from the Spanish Ministry of Science and Innovation (grant PID2019-10858RB-I00) and from the Galician Government (grants ED431C 2018/033, ED431C 2022/47, and ED431G 2019/01, both including FEDER financial support). C.S. acknowledges funding from the Galician Government (grant ED431C 2018/033, including FEDER financial support) and from CSIC (intramural grant DAOBIO, PIE 202070E036). I.O.M. acknowledges grant PID2021-127888NA-I00 (COMPSYNBIO) funded by MCIN/AEI/10.13039/501100011033, grant TED2021-131049B–I00 (BioEcoDBTL) funded by MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR and grant CIAICO/2021/159 (SmartBioFab) funded by Generalitat Valenciana. The funding bodies played no role in the design of the study, the collection, and analysis of the data or in the writing of the manuscript.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

IDESS: A toolbox for identification and automated design of stochastic gene circuits

  • Sequeiros Ferreiro, Carlos Xosé
  • Pájaro Diéguez, Manuel
  • Vázquez, Carlos
  • Banga, Julio R.
  • Otero-Muras, Irene
[Motivation]: One of the main causes hampering predictability during the model identification and automated design of gene circuits in synthetic biology is the effect of molecular noise. Stochasticity may significantly impact the dynamics and function of gene circuits, specially in bacteria and yeast due to low mRNA copy numbers. Standard stochastic simulation methods are too computationally costly in realistic scenarios to be applied to optimization-based design or parameter estimation., [Results]: In this work, we present IDESS (Identification and automated Design of Stochastic gene circuitS), a software toolbox for optimization-based design and model identification of gene regulatory circuits in the stochastic regime. This software incorporates an efficient approximation of the Chemical Master Equation as well as a stochastic simulation algorithm-both with GPU and CPU implementations-combined with global optimization algorithms capable of solving Mixed Integer Nonlinear Programming problems. The toolbox efficiently addresses two types of problems relevant in systems and synthetic biology: The automated design of stochastic synthetic gene circuits, and the parameter estimation for model identification of stochastic gene regulatory networks., This work was supported by grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033 and the CSIC intramural project grant PIE DAOBIO [PIE 202070E036] to J.R.B.; the PID2019-108584RB-I00, funded by Spanish MCIN/AEI to C.V.; the Galician Government [ED431C 2022/47, ED431G 2019/01, both including FEDER funds] to M.P., C.S., and C.V.; and grant PID2021-127888NA-I00 (COMPSYNBIO) funded by MCIN/AEI/10.13039/501100011033, grant TED2021-131049B-I00 (BioEcoDBTL) funded by MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR and grant CIAICO/2021/159 (SmartBioFab) funded by Generalitat Valenciana to I.O.-M., 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
Publication Artículo científico (JournalArticle)

Global optimization approach for parameter estimation in stochastic dynamic mdels of biosystems

  • Sequeiros Ferreiro, Carlos Xosé
  • Otero-Muras, Irene
  • Vázquez, Carlos
  • Banga, Julio R.
The code used to obtain the results reported here is available at https://doi.org/10.5281/zenodo.5195408., Mechanistic dynamic models have become an essential tool for understanding biomolecular networks and other biological systems. Biochemical stochasticity can be extremely important in some situations, e.g., at the single-cell level where there is a low copy number of the species involved. In these scenarios, deterministic models are not suitable to characterize the dynamics, so stochastic dynamic models should be considered. Here, we address the challenging problem of parameter estimation in stochastic dynamic models. Despite recent advances, this area is considerably less mature than its deterministic counterpart. We present a novel strategy based on two components: (i) global optimization via a hybrid stochastic-deterministic approach, and (ii) stochastic simulation techniques tailored to the sparsity of the available experimental data. Regarding the latter, for cases of dense population data we make use of a novel approach using a Partial Integro-Differential Equation (PIDE) model solved using a semilagrangian method. In order to further speed up the simulations, we also present efficient parallel implementations for multi-core CPUs and also for graphical processing units (GPUs). Importantly, whereas SDE and Fokker Planck approximations of the Chemical Master Equation (CME) apply when the reactant populations are sufficiently large, the PIDE approximation to the CME is valid for very low copy numbers, and therefore they enable us to tackle parameter estimation for systems with large intrinsic molecular noise, (highly stochastic regimes far from the thermodynamic limit). We test our strategy with four challenging problems: a Lotka-Volterra system, a polarization system in S. cerevisiae, a genetic toggle switch, and a genetic circadian oscillator. Our method could successfully solve these problems in very reasonable computation times (often a few minutes for the first two problems) using standard low-cost hardware, showing very significant speedups with respect to recent alternative methods., JRB acknowledges financial support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033 and also from the CSIC intramural project grant PIE DAOBIO (PIE 202070E036). CV acknowledges funding from the Spanish Ministry of Science (grant MTM2016-76497-R) and from the Galician Government (grants ED431C2018/033 and ED431G 2019/01, both including FEDER financial support). CS acknowledges funding from the Galician Government (grant ED431C2018/033, including FEDER financial support), and from CSIC (DAOBIO, PIE 202070E036). IOM acknowledges funding from the Spanish Ministry of Science and Innovation, grant PID2021-127888NA-I00 (COMPSYNBIO), Xunta de Galicia through GAIN Oportunius grant 20211020034 and DysCoVir-I2SysBio-CRM CSIC Associated Unit., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Transcription factor-based biosensors for screening and dynamic regulation

  • Tellechea-Luzardo, Jonathan
  • Stiebritz, Martin T.
  • Carbonell, Pablo
Advances in synthetic biology and genetic engineering are bringing into the spotlight a wide range of bio-based applications that demand better sensing and control of biological behaviours. Transcription factor (TF)-based biosensors are promising tools that can be used to detect several types of chemical compounds and elicit a response according to the desired application. However, the wider use of this type of device is still hindered by several challenges, which can be addressed by increasing the current metabolite-activated transcription factor knowledge base, developing better methods to identify new transcription factors, and improving the overall workflow for the design of novel biosensor circuits. These improvements are particularly important in the bioproduction field, where researchers need better biosensor-based approaches for screening production-strains and precise dynamic regulation strategies. In this work, we summarize what is currently known about transcription factor-based biosensors, discuss recent experimental and computational approaches targeted at their modification and improvement, and suggest possible future research directions based on two applications: bioproduction screening and dynamic regulation of genetic circuits., JT-L was supported by European Union Marie Skłodowska-Curie Action Individual Postdoctoral Fellowship (Grant agreement ID: 101062593). JT-L was supported by the Next-Generation EU (NGEU) fund through the Spanish Recovery, Transformation and Resilience Plan via a Margarita Salas personal grant from the Spanish Ministry of Universities (UNI/551/2021). MS was supported by the Next-Generation EU (NGEU) fund through the Spanish Recovery, Transformation and Resilience Plan via a María Zambrano personal grant from the Spanish Ministry of Universities (UNI/551/2021). PC acknowledges MCIN/AEI/10.13039/501100011033 funding through PID 2020-117271RB-C2 (BIODYNAMICS). PC was supported by the Spanish Ministry of Universities (UNI/551/2021), grant number UP 2021-036 funded by European Union - Next-generation EU. This research received financial support from Generalitat Valenciana through grant CIAICO/2021/159 (SmartBioFab). PC acknowledges MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR funding through grant TED 2021-131049 B-I00 (BioEcoDBTL). PC acknowledges MCIN/AEI/10.13039/501100011033 funding through grant PID 2021-127888NA-I00 (COMPSYNBIO)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Reusable rule-based cell cycle model explains compartment-resolved dynamics of 16 observables in RPE-1 cells

  • Lang, Paul F
  • Penas, David R.
  • Banga, Julio R.
  • Weindl, Daniel
  • Novak, Bela
Data Availability: GitHub hyperlinks to the PEtab problems (https://github.com/paulflang/cell_cycle_petab/tree/d562d3d4d19921ff851c06d0854b8b3f05c63d85), the results of the time course reconstruction (https://github.com/paulflang/cell_cycle_time_course/tree/e2d373d15bea86565d38b70dcc207564edd08d6b) and the presented model versions (https://github.com/paulflang/cell_cycle_model/tree/b0a820288bc98d62333acf8434174b6446df0574) are provided throughout the text. saCeSS can be accessed via https://bitbucket.org/DavidPenas/sacess-library/branch/sacess_cell_cycle_petab. Additionally, we generated DOIs on ZENODO for the PEtab problems (https://doi.org/10.5281/zenodo.7894097), the results of the time course reconstruction (https://doi.org/10.5281/zenodo.7700130) and the presented model versions (https://doi.org/10.5281/zenodo.7700177)., The mammalian cell cycle is regulated by a well-studied but complex biochemical reaction system. Computational models provide a particularly systematic and systemic description of the mechanisms governing mammalian cell cycle control. By combining both state-of-the-art multiplexed experimental methods and powerful computational tools, this work aims at improving on these models along four dimensions: model structure, validation data, validation methodology and model reusability. We developed a comprehensive model structure of the full cell cycle that qualitatively explains the behaviour of human retinal pigment epithelial-1 cells. To estimate the model parameters, time courses of eight cell cycle regulators in two compartments were reconstructed from single cell snapshot measurements. After optimisation with a parallel global optimisation metaheuristic we obtained excellent agreements between simulations and measurements. The PEtab specification of the optimisation problem facilitates reuse of model, data and/or optimisation results. Future perturbation experiments will improve parameter identifiability and allow for testing model predictive power. Such a predictive model may aid in drug discovery for cell cycle-related disorders., JRB and DRP acknowledge support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/01100011033. 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
Publication Artículo científico (JournalArticle)

Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applications

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
19 páginas, 11 figuras, 6 tablas, Binary combinatorial optimization plays a crucial role in various scientific and engineering fields. While deterministic approaches have traditionally been used to solve these problems, stochastic methods, particularly metaheuristics, have gained popularity in recent years for efficiently handling large problem instances. Ant Colony Optimization (ACO) is among the most successful metaheuristics and is frequently employed in non-binary combinatorial problems due to its adaptability. Although for binary combinatorial problems ACO can suffer from issues such as rapid convergence to local minima, its eminently parallel structure means that it can be exploited to solve large and complex problems also in this field. In order to provide a versatile ACO implementation that achieves competitive results across a wide range of binary combinatorial optimization problems, we introduce a parallel multicolony strategy with an improved cooperation scheme to maintain search diversity. We evaluate our proposal (Binary Parallel Cooperative ACO, BiPCACO) using a comprehensive benchmark framework, showcasing its performance and, most importantly, its flexibility as a successful all-purpose solver for binary combinatorial problems., RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033, PID2022 also funded by ‘ERDF A way of making Europe’, EU; Xunta de Galicia and FEDER funds of the EU (Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercom- puting Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Parameter estimation in a whole-brain network model of epilepsy: Comparison of parallel global optimization solvers

  • Penas, David R.
  • Hashemi, M.
  • Jirsa, V.K.
  • Banga, Julio R.
23 pages, 9 figures, 3 tables; S1 File. Supporting material document. https://doi.org/10.1371/journal.pcbi.1011642.s001 (PDF), The Virtual Epileptic Patient (VEP) refers to a computer-based representation of a patient with epilepsy that combines personalized anatomical data with dynamical models of abnormal brain activities. It is capable of generating spatio-temporal seizure patterns that resemble those recorded with invasive methods such as stereoelectro EEG data, allowing for the evaluation of clinical hypotheses before planning surgery. This study highlights the effectiveness of calibrating VEP models using a global optimization approach. The approach utilizes SaCeSS, a cooperative metaheuristic capable of parallel computation, to yield high-quality solutions without requiring excessive computational time. Through extensive benchmarking on synthetic data, our proposal successfully solved a set of different configurations of VEP models, demonstrating better scalability and superior performance against other parallel solvers. These results were further enhanced using a Bayesian optimization framework for hyperparameter tuning, with significant gains in terms of both accuracy and computational cost. Additionally, we added a scalable uncertainty quantification phase after model calibration, and used it to assess the variability in estimated parameters across different problems. Overall, this study has the potential to improve the estimation of pathological brain areas in drug-resistant epilepsy, thereby to inform the clinical decision-making process., This work was funded by the Spanish Agencia Estatal de Investigacion MCIN/AEI/10.13039/501100011033 grant PID2020-117271RB-C22 BIODYNAMICS (https://www.aei.gob.es/) to JRB, by the French National Research Agency (ANR) as part of the second“Investissements d’Avenir” program, ANR-17-RHUS-0004, EPINOV (https://anr.fr) and ANR-22-PESN-0012 (France 2030 program) to VJ and MH,by the European Union’s Horizon Europe Programme under the Specific Grant Agreement No.101147319 EBRAINS 2.0 Project (https://ec.europa.eu/programmes/horizon2020) to VJ. The funders did not play any role in the study design, data collection and analysis, decision to publish, or preparation of the manuscript. The authors acknowledge CESGA (Centro de Supercomputación de Galicia) for providing access to its FinisTerrae III supercomputer., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Population based metaheuristics in Spark: Towards a general framework using PSO as a case study

  • Pardo, Xoán C.
  • Gonzalez, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
26 pages, 19 figures, 16 tables; The code and data used for this research are available in public repositories referenced in the article., Over the years metaheuristics have been successfully applied to optimization problems in many real-world applications. The increasing complexity and scale of the problems addressed has posed new challenges to researchers in the field. The application of distributed metaheuristics is a common approach to speed up the time to solution or improve its quality by leveraging traditional parallel programming models on platforms like multicore processors or computer clusters. More recently, the emergence of Cloud Computing and new programming models and frameworks for Big Data has facilitated access to an unprecedented amount of computational resources, which led to a growing interest in optimization frameworks that support the development and execution of distributed metaheuristics taking advantage of this potential. In this paper, we present the current status of development of one such framework that aims to provide support for the application of distributed population-based metaheuristics to the global optimization of large-scale problems in Spark. The framework provides a reduced set of abstractions to represent the general structure of population-based metaheuristics as templates and strategies to particularize them into concrete metaheuristics, as well as other nice features like out of the box implementations of the most common distributed models, full configurability through a human-friendly format, and the possibility of rapid prototyping and testing metaheuristics in the Spark shell. To validate the approach, a template for Particle Swarm Optimization (PSO) was implemented as a proof of concept, which includes strategies for instantiating different variants of the algorithm, configurable topologies, and sequential and distributed execution models., This work was supported by MCIN/AEI/10.13039/501100011033 [grant numbers PID2019-104184RB-I00, PID2022-136435NB-I00 and PID2020-117271RB-C22 (BIODYNAMICS)], PID2022 also funded by “ERDF A way of making Europe”, EU. Also supported by Xunta de Galicia [grant number ED431C 2021/30]. Funding for open access charge: Universidade da Coruña/CISUG ., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Identification of dynamic models of microbial communities: A workflow addressing identifiability and modeling pitfalls

  • Paredes-Vázquez, Ana
  • Balsa-Canto, Eva
  • Banga, Julio R.
22 pages, 4 figures, 2 tables, Microbial communities, complex ecological networks crucial for human and planetary health, remain poorly understood in terms of the quantitative principles governing their composition, assembly, and function. Dynamic modeling using ordinary differential equations (ODEs) is a powerful framework for understanding and predicting microbiome behaviors. However, developing reliable ODE models is severely hampered by their nonlinear nature and the presence of significant challenges, particularly critical issues related to identifiability. Here, we address the identification problem in dynamic microbial community models by proposing an integrated methodology to tackle key challenges. Focusing on nonlinear ODE-based models, we examine four critical pitfalls: identifiability issues (structural and practical), unstable dynamics (potentially leading to numerical blow-up), underfitting (convergence to suboptimal solutions), and overfitting (fitting noise rather than signal). These pitfalls yield unreliable parameter estimates, unrealistic model behavior, and poor generalization. Our study presents a comprehensive workflow incorporating structural and practical identifiability analysis, robust global optimization for calibration, stability checks, and rigorous predictive power assessment. The methodology’s effectiveness and versatility in mitigating these pitfalls are demonstrated through case studies of increasing complexity, paving the way for more reliable and mechanistically insightful models of microbial communities, JRB acknowledges support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033, from grant PID2023-146275NB-C22 (DYNAMO-bio) funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU, and from grant CSIC PIE 202470E108 (LARGO). APV acknowledges support (salary) from grant PREP2023-002147, funded by MICIU/AEI/10.13039/501100011033/ and the European Social Fund Plus (ESF+), as part of the project PID2023-146275NB-C22, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Generalized inverse optimal control and its application in biology

  • Banga, Julio R.
  • Sager, Sebastian
28 pages, 9 figures, 1 table; Data will be made available on request., Living organisms exhibit remarkable adaptations across all scales, from molecules to ecosystems. We believe that many of these adaptations correspond to optimal solutions driven by evolution, training, and underlying physical and chemical laws and constraints. While some argue against such optimality principles due to their potential ambiguity, we propose generalized inverse optimal control to infer them directly from data. This comprehensive approach incorporates multi-criteria optimality, nestedness of objective functions on different scales, the presence of active constraints, the possibility of switches of optimality principles during the observed time horizon, maximization of robustness and minimization of time as important special cases, as well as uncertainties involved with the mathematical modeling of biological systems. This data-driven approach ensures that optimality principles are not merely theoretical constructs but are firmly rooted in experimental observations. The inferred principles can also be used in forward optimal control to predict and manipulate biological systems, with possible applications in bio-medicine, biotechnology, and agriculture. As discussed and illustrated, the well-posed problem formulation and the inference are challenging and require a substantial interdisciplinary effort in the development of theory and robust numerical methods., JRB acknowledges financial support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033, from grant PID2023-146275NB-C22 (DYNAMO-bio) funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU, and from grant PIE 202470E108 (LARGO) funded by CSIC. SS acknowledges financial support from the research initiative “SmartProSys: Intelligent Process Systems for the Sustainable Production of Chemicals” funded by the Ministry for Science, Energy, Climate Protection and the Environment of the State of Saxony-Anhalt, from the European Regional Development Fund (grants timingMatters, IntelAlgen, and Center for Dynamic Systems), and from the German Research Foundation DFG via grant 314838170, GRK 2297 MathCoRe., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A Parameter Control Strategy for Parallel Island-Based Metaheuristics

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
In the field of optimisation, the accurate configuration of parameters in metaheuristic algorithms is a critical yet often arduous task that significantly impacts the efficiency and efficacy of the search process. This study was motivated by the need to address the inefficiencies and limitations associated with conventional methods of parameter configuration, which typically involve manual, trial-and-error approaches. These traditional methods can lead to suboptimal performance and increased computational overhead. To tackle these challenges, this study introduces a novel adaptive parameter control strategy for parallel island-based metaheuristics, with a particular emphasis on the ant colony optimisation (ACO) algorithm. Our research process involved extensive experimentation to evaluate the effectiveness of this adaptive strategy. We conducted a series of tests to enable real-time adjustment of key parameters based on the performance of ACO colonies, thereby enhancing both exploration and exploitation capabilities. The results indicate that the adaptive strategy consistently outperforms offline manual and automated tuning configurations, particularly in larger and more complex problem instances, providing a more efficient solution for parameter optimisation in metaheuristics. These findings highlight the potential of dynamic parameter control to reduce dependency on expert knowledge and manual tuning while improving algorithmic performance., This work was supported by Ministerio de Ciencia, Innovación y Universidades and European Regional Development Fund (PID2022-136435NB-I00, PID2020-117271RB-C22, PID2023-146275NB-C22), and by Centro Superior de Investigaciones Científicas (PIE-202470E108).
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

A protocol for dynamic model calibration

  • Fernández Villaverde, Alejandro
  • Pathirana, Dilan
  • Fröhlich, Fabian
  • Hasenauer, Jan
  • Banga, Julio R.
Financiado para publicación en acceso aberto: Universidade de Vigo/CISUG, Ordinary differential equation models are nowadays widely used for the mechanistic description of biological processes and their temporal evolution. These models typically have many unknown and nonmeasurable parameters, which have to be determined by fitting the model to experimental data. In order to perform this task, known as parameter estimation or model calibration, the modeller faces challenges such as poor parameter identifiability, lack of sufficiently informative experimental data and the existence of local minima in the objective function landscape. These issues tend to worsen with larger model sizes, increasing the computational complexity and the number of unknown parameters. An incorrectly calibrated model is problematic because it may result in inaccurate predictions and misleading conclusions. For nonexpert users, there are a large number of potential pitfalls. Here, we provide a protocol that guides the user through all the steps involved in the calibration of dynamic models. We illustrate the methodology with two models and provide all the code required to reproduce the results and perform the same analysis on new models. Our protocol provides practitioners and researchers in biological modelling with a one-stop guide that is at the same time compact and sufficiently comprehensive to cover all aspects of the problem, MCIN/AEI/ 10.13039/501100011033 | Ref. PID2020-117271RB-C2, MCIN/AEI/ 10.13039/501100011033 | Ref. DPI2017-82896-C2-2-R, MCIN/AEI/10.13039/501100011033 | Ref. RYC-2019-027537-I, Xunta de Galicia | Ref. ED431F 2021/003
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Distilling identifiable and interpretable dynamic models from biological data

  • Massonis, Gemma
  • Fernández Villaverde, Alejandro
  • Banga, Julio R.
Mechanistic dynamical models allow us to study the behavior of complex biological systems. They can provide an objective and quantitative understanding that would be difficult to achieve through other means. However, the systematic development of these models is a non-trivial exercise and an open problem in computational biology. Currently, many research efforts are focused on model discovery, i.e. automating the development of interpretable models from data. One of the main frameworks is sparse regression, where the sparse identification of nonlinear dynamics (SINDy) algorithm and its variants have enjoyed great success. SINDy-PI is an extension which allows the discovery of rational nonlinear terms, thus enabling the identification of kinetic functions common in biochemical networks, such as Michaelis-Menten. SINDy-PI also pays special attention to the recovery of parsimonious models (Occam’s razor). Here we focus on biological models composed of sets of deterministic nonlinear ordinary differential equations. We present a methodology that, combined with SINDy-PI, allows the automatic discovery of structurally identifiable and observable models which are also mechanistically interpretable. The lack of structural identifiability and observability makes it impossible to uniquely infer parameter and state variables, which can compromise the usefulness of a model by distorting its mechanistic significance and hampering its ability to produce biological insights. We illustrate the performance of our method with six case studies. We find that, despite enforcing sparsity, SINDy-PI sometimes yields models that are unidentifiable. In these cases we show how our method transforms their equations in order to obtain a structurally identifiable and observable model which is also interpretable., Agencia Estatal de Investigación | Ref. PID2020-117271RB-C22, Consejo Superior de Investigaciones Científicas | Ref. PIE 202070E062, Agencia Estatal de Investigación | Ref. PID2020-113992RA-I00, Xunta de Galicia | Ref. ED431F 2021/003, Agencia Estatal de Investigación | Ref. RYC-2019- 027537-I
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Assessment of prediction uncertainty quantification methods in systems Biology

  • Fernández Villaverde, Alejandro
  • Banga, Julio R.
  • Raimúndez, Elba
  • Hasenauer, Jan
Biological processes are often modelled using ordinary differential equations. The unknown parameters of these models are estimated by optimizing the fit of model simulation and experimental data. The resulting parameter estimates inevitably possess some degree of uncertainty. In practical applications it is important to quantify these parameter uncertainties as well as the resulting prediction uncertainty, which are uncertainties of potentially time-dependent model characteristics. Unfortunately, estimating prediction uncertainties accurately is nontrivial, due to the nonlinear dependence of model characteristics on parameters. While a number of numerical approaches have been proposed for this task, their strengths and weaknesses have not been systematically assessed yet. To fill this knowledge gap, we apply four state of the art methods for uncertainty quantification to four case studies of different computational complexities. This reveals the trade-offs between their applicability and their statistical interpretability. Our results provide guidelines for choosing the most appropriate technique for a given problem and applying it successfully., Xunta de Galicia | Ref. ED431F 2021/003, Agencia Estatal de Investigación | Ref. RYC-2019-027537-I, Agencia Estatal de Investigación | Ref. PID2020-117271RB-C2, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Improving dynamic predictions with ensembles of observable models

  • Massonis Feixas, Gemma
  • Fernández Villaverde, Alejandro
  • Banga, Julio R.
Financiado para publicación en acceso aberto: Universidade de Vigo/CISUG, Motivation: Dynamic mechanistic modelling in systems biology has been hampered by the complexity and variability associated with the underlying interactions, and by uncertain and sparse experimental measurements. Ensemble modelling, a concept initially developed in statistical mechanics, has been introduced in biological applications with the aim of mitigating those issues. Ensemble modelling uses a collection of different models compatible with the observed data to describe the phenomena of interest. However, since systems biology models often suffer from lack of identifiability and observability, ensembles of models are particularly unreliable when predicting non-observable states. Results: We present a strategy to assess and improve the reliability of a class of model ensembles. In particular, we consider kinetic models described using ordinary differential equations (ODEs) with a fixed structure. Our approach builds an ensemble with a selection of the parameter vectors found when performing parameter estimation with a global optimization metaheuristic. This technique enforces diversity during the sampling of parameter space and it can quantify the uncertainty in the predictions of state trajectories. We couple this strategy with structural identifiability and observability analysis, and when these tests detect possible prediction issues we obtain model reparameterizations that surmount them. The end result is an ensemble of models with the ability to predict the internal dynamics of a biological process. We demonstrate our approach with models of glucose regulation, cell division, circadian oscillations, and the JAK-STAT signalling pathway. Availability: The code that implements the methodology and reproduces the results is available at https://doi.org/10.5281/zenodo.6782638. Supplementary information: Supplementary data are available at Bioinformatics online., MCIN/AEI/ 10.13039/501100011033 | Ref. PID2020-117271RBC22, MCIN/AEI/ 10.13039/501100011033 | Ref. PID2020-113992RA-I00, MCIN/AEI/ 10.13039/501100011033 | Ref. RYC-2019-027537-I, Xunta de Galicia | Ref. ED431F 2021/003
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

AutoRepar: a method to obtain identifiable and observable reparameterizations of dynamic models with mechanistic insights

  • Massonis Feixas, Gemma
  • Banga, Julio R.
  • Fernández Villaverde, Alejandro
Mechanistic dynamic models of biological systems allow for a quantitative and systematic interpretation of data and the generation of testable hypotheses. However, these models are often over-parameterized, leading to nonidentifiability and nonobservability, that is, the impossibility of inferring their parameters and state variables. The lack of structural identifiability and observability (SIO) compromises a model's ability to make predictions and provide insight. Here we present a methodology, AutoRepar, that corrects SIO deficiencies of nonlinear ODE models automatically, yielding reparameterized models that are structurally identifiable and observable. The reparameterization preserves the mechanistic meaning of selected variables, and has the exact same dynamics and input-output mapping as the original model. We implement AutoRepar as an extension of the STRIKE-GOLDD software toolbox for SIO analysis, applying it to several models from the literature to demonstrate its ability to repair their structural deficiencies. AutoRepar increases the applicability of mechanistic models, enabling them to provide reliable information about their parameters and dynamics., Consejo Superior de Investigaciones Científicas | Ref. PIE 202070E062, Agencia Estatal de Investigación | Ref. RYC-2019-027537-I, Agencia Estatal de Investigación | Ref. PID2020-113992RA-I00, Agencia Estatal de Investigación | Ref. PID2020-117271RB-C2, Agencia Estatal de Investigación | Ref. DPI2017-82896-C2-2-R, Xunta de Galicia | Ref. ED431F 2021/003, Universidade de Vigo/CISUG
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Population based metaheuristics in Spark: Towards a general framework using PSO as a case study

  • Pardo, Xoán C.
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Over the years metaheuristics have been successfully applied to optimization problems in many real-world applications. The increasing complexity and scale of the problems addressed has posed new challenges to researchers in the field. The application of distributed metaheuristics is a common approach to speed up the time to solution or improve its quality by leveraging traditional parallel programming models on platforms like multicore processors or computer clusters. More recently, the emergence of Cloud Computing and new programming models and frameworks for Big Data has facilitated access to an unprecedented amount of computational resources, which led to a growing interest in optimization frameworks that support the development and execution of distributed metaheuristics taking advantage of this potential. In this paper, we present the current status of development of one such framework that aims to provide support for the application of distributed population-based metaheuristics to the global optimization of large-scale problems in Spark. The framework provides a reduced set of abstractions to represent the general structure of population-based metaheuristics as templates and strategies to particularize them into concrete metaheuristics, as well as other nice features like out of the box implementations of the most common distributed models, full configurability through a human-friendly format, and the possibility of rapid prototyping and testing metaheuristics in the Spark shell. To validate the approach, a template for Particle Swarm Optimization (PSO) was implemented as a proof of concept, which includes strategies for instantiating different variants of the algorithm, configurable topologies, and sequential and distributed execution models., This work was supported by MCIN/AEI/10.13039/501100011033 [grant numbers PID2019-104184RB-I00 , PID2022-136435NB-I00 and PID2020-117271RB-C22 (BIODYNAMICS) ], PID2022 also funded by “ ERDF A way of making Europe ”, EU. Also supported by Xunta de Galicia [grant number ED431C 2021/30 ]. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applications

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Binary combinatorial optimization plays a crucial role in various scientific and engineering fields. While deterministic approaches have traditionally been used to solve these problems, stochastic methods, particularly metaheuristics, have gained popularity in recent years for efficiently handling large problem instances. Ant Colony Optimization (ACO) is among the most successful metaheuristics and is frequently employed in non-binary combinatorial problems due to its adaptability. Although for binary combinatorial problems ACO can suffer from issues such as rapid convergence to local minima, its eminently parallel structure means that it can be exploited to solve large and complex problems also in this field. In order to provide a versatile ACO implementation that achieves competitive results across a wide range of binary combinatorial optimization problems, we introduce a parallel multicolony strategy with an improved cooperation scheme to maintain search diversity. We evaluate our proposal (Binary Parallel Cooperative ACO, BiPCACO) using a comprehensive benchmark framework, showcasing its performance and, most importantly, its flexibility as a successful all-purpose solver for binary combinatorial problems., RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033, PID2022 also funded by ‘ERDF A way of making Europe’, EU; Xunta de Galicia and FEDER funds of the EU (Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercom- puting Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG, Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

An Efficient Ant Colony Optimization Framework for HPC Environments

  • González, Patricia
  • Osorio, Roberto
  • Pardo, Xoán C.
  • Banga, Julio R.
  • Doallo, Ramón
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] Combinatorial optimization problems arise in many disciplines, both in the basic sciences and in applied fields such as engineering and economics. One of the most popular combinatorial optimization methods is the Ant Colony Optimization (ACO) metaheuristic. Its parallel nature makes it especially attractive for implementation and execution in High Performance Computing (HPC) environments. Here we present a novel parallel ACO strategy making use of efficient asynchronous decentralized cooperative mechanisms. This strategy seeks to fulfill two objectives: (i) acceleration of the computations by performing the ants’ solution construction in parallel; (ii) convergence improvement through the stimulation of the diversification in the search and the cooperation between different colonies. The two main features of the proposal, decentralization and desynchronization, enable a more effective and efficient response in environments where resources are highly coupled. Examples of such infrastructures include both traditional HPC clusters, and also new distributed environments, such as cloud infrastructures, or even local computer networks. The proposal has been evaluated using the popular Traveling Salesman Problem (TSP), as a well-known NP-hard problem widely used in the literature to test combinatorial optimization methods. An exhaustive evaluation has been carried out using three medium and large size instances from the TSPLIB library, and the experiments show encouraging results with superlinear speedups compared to the sequential algorithm (e.g. speedups of 18 with 16 cores), and a very good scalability (experiments were performed with up to 384 cores improving execution time even at that scale)., This work was supported by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00 / AEI / 10.13039/501100011033), and by Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019–2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN / AEI / 10.13039/501100011033 through grant PID2020-117271RB-C22 (BIODYNAMICS), and from MCIN / AEI / 10.13039/501100011033 and “ERDF A way of making Europe” through grant DPI2017-82896-C2-2-R (SYNBIOCONTROL). Authors also acknowledge the Galician Supercomputing Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

IDESS: a toolbox for identification and automated design of stochastic gene circuits

  • Sequeiros Ferreiro, Carlos Xosé
  • Pájaro Diéguez, Manuel
  • Vázquez, Carlos
  • Banga, Julio R.
  • Otero-Muras, Irene
[Abstract]: Motivation One of the main causes hampering predictability during the model identification and automated design of gene circuits in synthetic biology is the effect of molecular noise. Stochasticity may significantly impact the dynamics and function of gene circuits, specially in bacteria and yeast due to low mRNA copy numbers. Standard stochastic simulation methods are too computationally costly in realistic scenarios to be applied to optimization-based design or parameter estimation. Results In this work, we present IDESS (Identification and automated Design of Stochastic gene circuitS), a software toolbox for optimization-based design and model identification of gene regulatory circuits in the stochastic regime. This software incorporates an efficient approximation of the Chemical Master Equation as well as a stochastic simulation algorithm—both with GPU and CPU implementations—combined with global optimization algorithms capable of solving Mixed Integer Nonlinear Programming problems. The toolbox efficiently addresses two types of problems relevant in systems and synthetic biology: the automated design of stochastic synthetic gene circuits, and the parameter estimation for model identification of stochastic gene regulatory networks. Availability and implementation IDESS runs under the MATLAB environment and it is available under GPLv3 license at https://doi.org/10.5281/zenodo.7788692., This work was supported by grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033 and the CSIC intramural project grant PIE DAOBIO [PIE 202070E036] to J.R.B.; the PID2019-108584RB-I00, funded by Spanish MCIN/AEI to C.V.; the Galician Government [ED431C 2022/47, ED431G 2019/01, both including FEDER funds] to M.P., C.S., and C.V.; and grant PID2021-127888NA-I00 (COMPSYNBIO) funded by MCIN/AEI/10.13039/501100011033, grant TED2021-131049B-I00 (BioEcoDBTL) funded by MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR and grant CIAICO/2021/159 (SmartBioFab) funded by Generalitat Valenciana to I.O.-M. The funding bodies played no role in the study design, the data collection and analysis, or the manuscript writing. We acknowledge support of the publication fee by the CSIC Open Access Publication Support Initiative through its Unit of Information Resources for Research (URICI)., Xunta de Galicia; ED431C 2022/47, Xunta de Galicia; ED431G 2019/01, Generalitat Valenciana; CIAICO/2021/159, CSIC; PIE 202070E036