Error catastrophe in populations under similarity-essential recombination

FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOCNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOOrganisms are often more likely to exchange genetic information with others that are similar to themselves. One of the most widely accepted mechanisms of RNA virus recombination requires substantial sequence similarity between the parental RNAs and is termed similarity-essential recombination. This mechanism may be considered analogous to assortative mating, an important form of non-random mating that can be found in animals and plants. Here we study the dynamics of haplotype frequencies in populations evolving under similarity-essential recombination. Haplotypes are represented by a genome of B biallelic loci and the Hamming distance between individuals is used as a criterion for recombination. We derive the evolution equations for the haplotype frequencies assuming that recombination does not occur if the genetic distance is larger than a critical value G and that mutation occurs at a rate pi per locus. Additionally, uniform crossover is considered. Although no fitness is directly associated to the haplotypes, we show that frequency-dependent selection emerges dynamically and governs the haplotype distribution. A critical mutation rate it, can be identified as the error threshold transition, beyond which this selective information cannot be stored. For mu mu(c) the distribution becomes uniform, with all haplotypes having the same frequency. In the case of extreme assortativeness, where individuals only recombine with others identical to themselves (G=0), the error threshold results mu(c) = 1/4, independently of the genome size. For weak assortativity (G = B-1) mu(c) =2(-(B+1)) and for the case of no assortativity (G=B) mu(c)= 0. We compute the mutation threshold for 0 mu(c) the distribution becomes uniform, with all haplotypes having the same frequency. In the case of extreme assortativeness, where individuals only recombine with others identical to themselves (G=0), the error threshold results mu(c) = 1/4, independently of the genome size. For weak assortativity (G = B-1) mu(c) =2(-(B+1)) and for the case of no assortativity (G=B) mu(c)= 0. We compute the mutation threshold for 0 < G < B and show that, for large B, it depends only on the ratio G/B. We discuss the consequences of these results for recombination in viruses and for speciation.3744853FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOCNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOFAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOCNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOFAPESP [2014/04036-2, 2011/18622-2, 2014/10470-7]CNPq [303497/2014-9, 470598/2012-3]2011/18622-22014/04036-22014/10470-7470598/2012-3303497/2014-