z-logo
Premium
Predicting evolutionary potential: A numerical test of evolvability measures
Author(s) -
Hansen Thomas F.,
Solvin Thomas M.,
Pavlicev Mihaela
Publication year - 2019
Publication title -
evolution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.84
H-Index - 199
eISSN - 1558-5646
pISSN - 0014-3820
DOI - 10.1111/evo.13705
Subject(s) - evolvability , microevolution , selection (genetic algorithm) , trait , biology , evolutionarily stable strategy , set (abstract data type) , computer science , evolutionary biology , artificial intelligence , mathematics , game theory , mathematical economics , population , demography , sociology , programming language
Despite sophisticated mathematical models, the theory of microevolution is mostly treated as a qualitative rather than a quantitative tool. Numerical measures of selection, constraints, and evolutionary potential are often too loosely connected to theory to provide operational predictions of the response to selection. In this paper, we study the ability of a set of operational measures of evolvability and constraint to predict short‐term selection responses generated by individual‐based simulations. We focus on the effects of selective constraints under which the response in one trait is impeded by stabilizing selection on other traits. The conditional evolvability is a measure of evolutionary potential explicitly developed for this situation. We show that the conditional evolvability successfully predicts rates of evolution in an equilibrium situation, and further that these equilibria are reached with characteristic times that are inversely proportional to the fitness load generated by the constraining characters. Overall, we find that evolvabilities and conditional evolvabilities bracket responses to selection, and that they together can be used to quantify evolutionary potential on time scales where the G‐matrix remains relatively constant.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here