Abstract
Organisms 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 μ 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 μc can be identified as the error threshold transition, beyond which this selective information cannot be stored. For μ<μc the distribution consists of a dominant sequence surrounded by a cloud of closely related sequences, characterizing a quasispecies. For μ>μ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 μc=1/4, independently of the genome size. For weak assortativity (G=B-1)μc=2(-(B+1)) and for the case of no assortativity (G=B) μ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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.