Random partitions approximating the coalescence of lineages during a selective
被引:33
|
作者:
Schweinsberg, J
论文数: 0引用数: 0
h-index: 0
机构:Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
Schweinsberg, J
Durrett, R
论文数: 0引用数: 0
h-index: 0
机构:Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
Durrett, R
机构:
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
[2] Cornell Univ, Dept Math, Ithaca, NY 14853 USA
来源:
ANNALS OF APPLIED PROBABILITY
|
2005年
/
15卷
/
03期
基金:
美国国家科学基金会;
关键词:
coalescence;
random partition;
selective sweep;
mutation;
hitchhiking;
D O I:
10.1214/105051605000000430
中图分类号:
O21 [概率论与数理统计];
C8 [统计学];
学科分类号:
020208 ;
070103 ;
0714 ;
摘要:
When a beneficial mutation occurs in a population, the new, favored allele may spread to the entire population. This process is known as a selective sweep. Suppose we sample n individuals at the end of a selective sweep. If we focus on a site on the chromosome that is close to the location of the beneficial mutation, then many of the lineages will likely be descended from the individual that had the beneficial mutation, while others will be descended from a different individual because of recombination between the two sites. We introduce two approximations for the effect of a selective sweep. The first one is simple but not very accurate: flip n independent coins with probability p of heads and say that the lineages whose coins come up heads are those that are descended from the individual with the beneficial mutation. A second approximation, which is related to Kingman's paintbox construction, replaces the coin flips by integer-valued random variables and leads to very accurate results.
机构:
Drexel Univ, Dept Math, Philadelphia, PA 19104 USADrexel Univ, Dept Math, Philadelphia, PA 19104 USA
Goh, William M. Y.
Hitczenko, Pawel
论文数: 0引用数: 0
h-index: 0
机构:
Drexel Univ, Dept Math, Philadelphia, PA 19104 USA
Drexel Univ, Dept Comp Sci, Philadelphia, PA 19104 USADrexel Univ, Dept Math, Philadelphia, PA 19104 USA