Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Genetic drift
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Moran model=== The [[Moran process|Moran model]] assumes overlapping generations. At each time step, one individual is chosen to reproduce and one individual is chosen to die. So in each timestep, the number of copies of a given allele can go up by one, go down by one, or can stay the same. This means that the [[Stochastic matrix|transition matrix]] is [[tridiagonal matrix|tridiagonal]], which means that mathematical solutions are easier for the Moran model than for the Wright–Fisher model. On the other hand, [[computer simulation]]s are usually easier to perform using the Wright–Fisher model, because fewer time steps need to be calculated. In the Moran model, it takes ''N'' timesteps to get through one generation, where ''N'' is the [[effective population size]]. In the Wright–Fisher model, it takes just one.<ref>{{Cite journal | last1 = Moran | first1 = P. A. P. | author-link = Pat Moran (statistician) | doi = 10.1017/S0305004100033193 | title = Random processes in genetics | journal = [[Mathematical Proceedings of the Cambridge Philosophical Society]]| volume = 54 |issue=1| pages = 60–71| year = 1958 | bibcode = 1958PCPS...54...60M| s2cid = 85823386 }}</ref> In practice, the Moran and Wright–Fisher models give qualitatively similar results, but genetic drift runs twice as fast in the Moran model.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)