A numerical method for calculating moments of coalescent times in finite populations with selection
- 1 May 1989
- journal article
- research article
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 27 (3) , 355-368
- https://doi.org/10.1007/bf00275818
Abstract
A numerical method is developed for solving a nonstandard singular system of second-order differential equations arising from a problem in population genetics concerning the coalescent process for a sample from a population undergoing selection. The nonstandard feature of the system is that there are terms in the equations that approach infinity as one approaches the boundary. The numerical recipe is patterned after the LU decomposition for tridiagonal matrices. Although there is no analytic proof that this method leads to the correct solution, various examples are presented that suggest that the method works. This method allows one to calculate the expected number of segregating sites in a random sample of n genes from a population whose evolution is described by a model which is not selectively neutral.Keywords
This publication has 11 references indexed in Scilit:
- The coalescent process in models with selectionGenetics, 1988
- Numerical recipes: the art of scientific computingAnalytica Chimica Acta, 1987
- ON THE DIVERGENCE OF ALLELES IN NESTED SUBSAMPLES FROM FINITE POPULATIONSGenetics, 1986
- Line-of-descent and genealogical processes, and their applications in population genetics modelsTheoretical Population Biology, 1984
- The coalescentStochastic Processes and their Applications, 1982
- On the genealogy of large populationsJournal of Applied Probability, 1982
- Limit theorems for stationary distributionsAdvances in Applied Probability, 1975
- On the number of segregating sites in genetical models without recombinationTheoretical Population Biology, 1975