从任意大规模种群中进行精确且高效的谱系动力学模拟
Exact and efficient phylodynamic simulation from arbitrarily large populations
AI总结:
本文证明部分筛选确定的出生-死亡-突变-采样过程等价于完全采样且无死亡的过程,并据此提出一种与最终树大小线性相关、与种群大小无关的高效树模拟算法,使极大种群的谱系动力学模拟成为可能。
摘要:
许多生物学研究涉及从一个大种群中推断样本个体的进化历史,并解释重建的谱系树。这样一棵经过筛选确定的树通常只代表完整种群树的一小部分,并且会受到幸存者偏差和采样偏差的影响。从经过筛选确定的树中推断进化参数,需要对潜在的种群动态和筛选确定过程同时进行建模。这种谱系动力学建模的一个关键组成部分涉及树的模拟,而树的模拟被用于对概率推断方法进行基准测试。为了模拟一棵经过筛选确定的树,必须首先模拟完整的种群树,然后剪除未被观测到的谱系。因此,计算成本并不是由最终模拟树的大小决定的,而是由它所嵌入的种群树的大小决定的。在大多数生物学场景中,由于没有采样后代的谱系所带来的计算需求,对整个种群进行模拟的代价高得令人望而却步。在这里,我们通过证明以下结论来应对这一挑战:对于来自一般多类型出生-死亡-突变-采样模型的任何部分筛选确定过程,都存在一个具有完全采样且无死亡的等价过程,我们利用这一性质开发了一种用于模拟树的高效算法。我们的算法随最终模拟树的大小线性扩展,并且与种群大小无关,从而能够对超出当前方法能力范围的极大种群进行模拟,而这对于各种生物学应用来说是必不可少的。我们预计,这种前所未有的加速将显著推动需要大量训练数据的新型推断方法的发展。
英文摘要:
Many biological studies involve inferring the evolutionary history of a sample of individuals from a large population and interpreting the reconstructed tree. Such an ascertained tree typically represents only a small part of a comprehensive population tree and is distorted by survivorship and sampling biases. Inferring evolutionary parameters from ascertained trees requires modeling both the underlying population dynamics and the ascertainment process. A crucial component of this phylodynamic modeling involves tree simulation, which is used to benchmark probabilistic inference methods. To simulate an ascertained tree, one must first simulate the full population tree and then prune unobserved lineages. Consequently, the computational cost is determined not by the size of the final simulated tree, but by the size of the population tree in which it is embedded. In most biological scenarios, simulations of the entire population are prohibitively expensive due to computational demands placed on lineages without sampled descendants. Here, we address this challenge by proving that, for any partially ascertained process from a general multi-type birth-death-mutation-sampling model, there exists an equivalent process with complete sampling and no death, a property which we leverage to develop a highly efficient algorithm for simulating trees. Our algorithm scales linearly with the size of the final simulated tree and is independent of the population size, enabling simulations from extremely large populations beyond the reach of current methods but essential for various biological applications. We anticipate that this unprecedented speedup will significantly advance the development of novel inference methods that require extensive training data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。