The geometry of the Pareto front in biological phenotype space

نویسندگان

  • Hila Sheftel
  • Oren Shoval
  • Avi Mayo
  • Uri Alon
چکیده

When organisms perform a single task, selection leads to phenotypes that maximize performance at that task. When organisms need to perform multiple tasks, a trade-off arises because no phenotype can optimize all tasks. Recent work addressed this question, and assumed that the performance at each task decays with distance in trait space from the best phenotype at that task. Under this assumption, the best-fitness solutions (termed the Pareto front) lie on simple low-dimensional shapes in trait space: line segments, triangles and other polygons. The vertices of these polygons are specialists at a single task. Here, we generalize this finding, by considering performance functions of general form, not necessarily functions that decay monotonically with distance from their peak. We find that, except for performance functions with highly eccentric contours, simple shapes in phenotype space are still found, but with mildly curving edges instead of straight ones. In a wide range of systems, complex data on multiple quantitative traits, which might be expected to fill a high-dimensional phenotype space, is predicted instead to collapse onto low-dimensional shapes; phenotypes near the vertices of these shapes are predicted to be specialists, and can thus suggest which tasks may be at play.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems

The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...

متن کامل

Multi-objective optimization of buckling load for a laminated composite plate by coupling genetic algorithm and FEM

In this paper, a combination method has been developed by coupling Multi-Objective Genetic Algorithms (MOGA) and Finite Element Method (FEM). This method has been applied for determination of the optimal stacking sequence of laminated composite plate against buckling. The most important parameters in optimization of a laminated composite plate such as, angle, thickness, number, and material of ...

متن کامل

Urban Land-Use Allocation By A Cell-based Multi-Objective Optimization Algorithm

Allocating urban land-uses to land-units with regard to different criteria and constraints is considered as a spatial multi-objective problem. Generating various urban land-use layouts with respect to defined objectives for urban land-use allocation can support urban planners in confirming appropriate layouts. Hence, in this research, a multi-objective optimization algorithm based on grid is pr...

متن کامل

Optimization of Heat Transfer Enhancement of a Domestic Gas Burner Based on Pareto Genetic Algorithm: Experimental and Numerical Approach

The present study attempts to improve heat transfer efficiency of a domestic gas burner by enhancing heat transfer from flue gases. Heat transfer can be augmented using the obstacles that are inserted into the flow field near the heated wall of the domestic gas burner. First, to achive the maximum efficiency, the insert geometry is optimized by the multi-objective genetic algorithm so that heat...

متن کامل

A New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems

Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2013