P system model optimisation by means of evolutionary based search algorithms

  • Authors:
  • Carlos García-Martínez;Claudio Lima;Jamie Twycross;Natalio Krasnogor;Manuel Lozano

  • Affiliations:
  • University of Córdoba, Córdoba, Spain;University of Nottingham, Nottingham, United Kingdom;University of Nottingham, Nottingham, United Kingdom;University of Nottingham, Nottingham, United Kingdom;University of Granada, Granada, Spain

  • Venue:
  • Proceedings of the 12th annual conference on Genetic and evolutionary computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Executable Biology, also called Algorithmic Systems Biology, uses rigorous concepts from computer science and mathematics to build computational models of biological entities. P systems are emerging as one of the key modelling frameworks within Executable Biology. In this paper, we address the continuous backward problem: given a P system model structure and a target phenotype (i.e. an intended biological behaviour), one is tasked with finding the (near) optimal parameters for the model that would make the P system model produce the target behaviour as closely as possible. We test several real-valued parameter optimisation algorithms on this problem. More specifically, using four different test cases of increasing complexity, we perform experiments with four evolutionary algorithms, and one variable neighbourhood search method combining three other evolutionary algorithms. The results show that, when there are few parameters to optimise, a genetic and two differential evolution based algorithms are robust optimisers attaining the best results. However, when the number of parameters increases, the variable neighbourhood search approach performs better.