SimulateMovingOptimum
收藏DataONE2014-05-27 更新2024-06-27 收录
下载链接：
https://search.dataone.org/view/null
下载链接
链接失效反馈官方服务：
资源简介：
C++ code used for "adaptive-walk" simulations of the multidimensional moving-optimum model. In these simulations, the population is assumed to be monomorphic at all times, and new mutations are immediately lost or fixed. As a result, adaptation proceeds as a series of discrete "steps". Adaptive-walk simulations are much faster than individual-based simulations, and are more closely related to the analytical results in the paper. Similar assumptions have been used in other models of the genetics of adaptation (Gillespie, Orr...), and have been justified by the so-called strong-selection-weak-mutation assumption.
创建时间：
2014-05-27
