Search

Gene conversion is a ubiquitous phenomenon that leads to the exchange of genetic information between homologous DNA regions and maintains coevolving multi-gene families in most prokaryotic and eukaryotic organisms. In this paper, we study its implications for the evolution of a single functional gene with a silenced duplicate, using two different models of evolution on rugged fitness landscapes. Our analytical and numerical results show that, by helping to circumvent valleys of low fitness, gene conversion with a passive duplicate gene can cause a significant speedup of adaptation, which depends nontrivially on the frequency of gene conversion and the structure of the landscape. We find that stochastic effects due to finite population sizes further increase the likelihood of exploiting this evolutionary pathway. A universal feature appearing in both deterministic and stochastic analysis of our models is the existence of an optimal gene conversion rate, which maximizes the speed of adaptation. Our results reveal the potential for duplicate genes to act as a "scratch paper" that frees evolution from being limited to strictly beneficial mutations in strongly selective environments. [ABSTRACT FROM AUTHOR]

Motivation: Many important aspects of evolutionary dynamics can only be addressed through simulations. However, accurate simulations of realistically large populations over long periods of time needed for evolution to proceed are computationally expensive. Mutants can be present in very small numbers and yet (if they are more fit than others) be the key part of the evolutionary process. This leads to significant stochasticity that needs to be accounted for. Different evolutionary events occur at very different time scales: mutations are typically much rarer than reproduction and deaths.Results: We introduce a new exact algorithm for fast fully stochastic simulations of evolutionary dynamics that include birth, death and mutation events. It produces a significant speedup compared to direct stochastic simulations in a typical case when the population size is large and the mutation rates are much smaller than birth and death rates. The algorithm performance is illustrated by several examples that include evolution on a smooth and rugged fitness landscape. We also show how this algorithm can be adapted for approximate simulations of more complex evolutionary problems and illustrate it by simulations of a stochastic competitive growth model.Contact: ltsimring@ucsd.eduSupplementary information: Supplementary data are available at Bioinformatics online. [ABSTRACT FROM PUBLISHER]