An efficient algorithm for generating the internal branches of a Kingman coalescent.

Abstract excerpt

Coalescent simulations are a widely used approach for simulating sample genealogies, but can become computationally burdensome in large samples. Methods exist to analytically calculate a sample's expected frequency spectrum without simulating full genealogies. However, statistics that rely on the distribution of the length of internal coalescent branches, such as the probability that two mutations of equal size...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Computer Simulation
• Share to Genealogy and Heraldry