Abstract

Summary Full likelihood-based inference for modern population genetics data presents methodological and computational challenges. The problem is of considerable practical importance and has attracted recent attention, with the development of algorithms based on importance sampling (IS) and Markov chain Monte Carlo (MCMC) sampling. Here we introduce a new IS algorithm. The optimal proposal distribution for these problems can be characterized, and we exploit a detailed analysis of genealogical processes to develop a practicable approximation to it. We compare the new method with existing algorithms on a variety of genetic examples. Our approach substantially outperforms existing IS algorithms, with efficiency typically improved by several orders of magnitude. The new method also compares favourably with existing MCMC methods in some problems, and less favourably in others, suggesting that both IS and MCMC methods have a continuing role to play in this area. We offer insights into the relative advantages of each approach, and we discuss diagnostics in the IS framework.

Keywords

Markov chain Monte CarloInferenceComputer scienceExploitVariety (cybernetics)Sampling (signal processing)PopulationMachine learningImportance samplingMarkov chainMonte Carlo methodArtificial intelligenceMathematicsStatisticsBayesian probability

Affiliated Institutions

Related Publications

Publication Info

Year
2000
Type
article
Volume
62
Issue
4
Pages
605-635
Citations
313
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

313
OpenAlex

Cite This

Matthew Stephens, Peter Donnelly (2000). Inference in Molecular Population Genetics. Journal of the Royal Statistical Society Series B (Statistical Methodology) , 62 (4) , 605-635. https://doi.org/10.1111/1467-9868.00254

Identifiers

DOI
10.1111/1467-9868.00254