arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.6322q-bio.PEcs.CCcs.GTmath.DSmath.SP
收藏

遗传多样性〈动〉性<动>的复杂性

The Complexity of Genetic Diversity

Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Sadra Yazdanbod

摘要:

生物系统中的一个关键问题是,在进化竞争下,遗传多样性〈动〉性<动>是否会长期存在,或者是否会出现单一的优势基因型。卡尔穆斯在1945年的经典工作已经确定,即使在简单的二倍体物种(具有两条染色体的物种)中,只要杂合子个体享有选择优势,多样性也可以得到保证。尽管问题的经典性质,随着我们越来越多地走向多态性特征(例如人类血型〈动〉<动>),预测多样性和理解其含义仍然没有完全理解。我们的主要贡献是建立复杂性理论的硬度结果,这意味着即使在教科书的情况下,单基因座二倍体模型预测是否多样性生存或不考虑其适应度景观是算法上棘手的。我们补充我们的研究结果,建立随机选择的适应度景观多样性生存的显着概率。我们的结果在几个维度上都是结构稳健的(例如,参数分布的选择、稳定性/持久性的不同定义、对适应度景观的典型子类的限制)。从技术上讲,我们的研究结果利用博弈论,非线性动力系统,复杂性理论和生物学之间的联系,并建立硬度结果预测的一个确定性的变体的著名的乘法权重更新算法在对称协调游戏,这可能是独立的利益。

英文摘要:

A key question in biological systems is whether genetic diversity persists in the long run under evolutionary competition or whether a single dominant genotype emerges. Classic work by Kalmus in 1945 has established that even in simple diploid species (species with two chromosomes) diversity can be guaranteed as long as the heterozygote individuals enjoy a selective advantage. Despite the classic nature of the problem, as we move towards increasingly polymorphic traits (e.g. human blood types) predicting diversity and understanding its implications is still not fully understood. Our key contribution is to establish complexity theoretic hardness results implying that even in the textbook case of single locus diploid models predicting whether diversity survives or not given its fitness landscape is algorithmically intractable. We complement our results by establishing that under randomly chosen fitness landscapes diversity survives with significant probability. Our results are structurally robust along several dimensions (e.g., choice of parameter distribution, different definitions of stability/persistence, restriction to typical subclasses of fitness landscapes). Technically, our results exploit connections between game theory, nonlinear dynamical systems, complexity theory and biology and establish hardness results for predicting the evolution of a deterministic variant of the well known multiplicative weights update algorithm in symmetric coordination games which could be of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑