title: Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives.
abstract: The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input-output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria.
authors.affiliation: Center for Studies in Physics and Biology, The Rockefeller University, New York, NY 10065, USA.
authors.forename: Aryeh
authors.initials: A
authors.lastname: Warmflash
authors.forename: Paul
authors.initials: P
authors.lastname: Francois
authors.forename: Eric D
authors.initials: ED
authors.lastname: Siggia
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D005246:Feedback; D053263:Gene Regulatory Networks; D008957:Models, Genetic