Evolving BlenX programs to simulate the evolution of biological networks

Authors:
L. Dematté;C. Priami;A. Romanel;O. Soyer
Affiliations:
CoSBi, Piazza Manci 17, I-38100 Povo, Trento, Italy and Dipartimento di Ingegneria e Scienza dellInformazione, Universitá di Trento, Via Sommarive 14, I-38100 Povo, Trento, Italy;CoSBi, Piazza Manci 17, I-38100 Povo, Trento, Italy and Dipartimento di Ingegneria e Scienza dellInformazione, Universitá di Trento, Via Sommarive 14, I-38100 Povo, Trento, Italy;CoSBi, Piazza Manci 17, I-38100 Povo, Trento, Italy and Dipartimento di Ingegneria e Scienza dellInformazione, Universitá di Trento, Via Sommarive 14, I-38100 Povo, Trento, Italy;CoSBi, Piazza Manci 17, I-38100 Povo, Trento, Italy
Venue:
Theoretical Computer Science
Year:
2008

Citing 5
Cited 2

Intelligence through simulated evolution: forty years of evolutionary programming

Intelligence through simulated evolution: forty years of evolutionary programming
Application of a stochastic name-passing calculus to representation and simulation of molecular processes

Information Processing Letters
Modelling and simulation of biological processes in BlenX

ACM SIGMETRICS Performance Evaluation Review
A formal and integrated framework to simulate evolution of biological pathways

CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
Beta binders for biological interactions

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology

A Framework for Modelling and Simulating Networks of Cells

Electronic Notes in Theoretical Computer Science (ENTCS)
Bacterially inspired evolving system with an application to time series prediction

Applied Soft Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present a formal approach to study the evolution of biological networks. We use the Beta Workbench and its BlenX language to model and simulate networks in connection with evolutionary algorithms. Mutations are done on the structure of BlenX programs and networks are selected at any generation by using a fitness function. The feasibility of the approach is illustrated with a simple example.