Local adaptation, recombination, and the fate of neopolyploids.

Stuart F McDaniel

Journal: The New phytologist 2024;244(1):32-38

PMID: 39045612

Abstract

Polyploidy is widely recognized as an important speciation mechanism because it isolates tetraploids from their diploid progenitors. Polyploidy also provides new genetic material that may facilitate adaptive evolution. However, new mutations are more likely to arise after a neopolyploid has already successfully invaded a population. Thus, the role of adaptive forces in establishing a polyploid remains unclear. One solution to this apparent paradox may lie in the capacity of polyploids to suppress recombination among preexisting locally adapted alleles. The local adaptation mechanism requires that spatially heterogeneous selection acts on multiple loci and that gene flow introduces maladapted alleles to the population where the polyploid forms. The mechanism requires neither strong genetic drift nor any intrinsic benefit of genome doubling and can accommodate any mode of gene action. A unique prediction of the mechanism is that adaptive alleles should predate polyploidization, a pattern consistent with observations from a few well-studied polyploids. The mechanism is also consistent with the coexistence of both diploid and tetraploid cytotypes, fitness heterogeneity among independently derived polyploids, and the prevalence of outcrossing among older polyploids. The local adaptation mechanism also makes novel predictions about circumstances favoring polyploid invasions that can be tested using molecular genetic or comparative approaches.

© 2024 The Author(s). New Phytologist © 2024 New Phytologist Foundation.

Address: Department of Biology, University of Florida, Gainesville, FL, 32611, USA.

Link outs

Subscription / membership required

Bant logo

© Copyright 2026, Nutrition Evidence

NED wishes to thank the following organisations for their support:

We use cookies to improve your experience and analyze site traffic with Google Analytics. By continuing to use our site, you agree to our use of cookies. Learn more.