Sequential importance sampling for multi-resolution Kingman-Tajima coalescent counting

02/14/2019
by   Lorenzo Cappello, et al.
0

Statistical inference of evolutionary parameters from molecular sequence data relies on coalescent models to account for the shared genealogical ancestry of the samples. However, inferential algorithms do not scale to available data sets. A strategy to improve computational efficiency is to rely on simpler coalescent and mutation models, resulting in smaller hidden state spaces. An estimate of the cardinality of the state-space of genealogical trees at different resolutions is essential to decide the best modeling strategy for a given dataset. To our knowledge, there is neither an exact nor approximate method to determine these cardinalities. We propose a sequential importance sampling algorithm to estimate the cardinality of the space of genealogical trees under different coalescent resolutions. Our sampling scheme proceeds sequentially across the set of combinatorial constraints imposed by the data. We analyse the cardinality of different genealogical tree spaces on simulations to study the settings that favor coarser resolutions. We estimate the cardinality of genealogical tree spaces from mtDNA data from the 1000 genomes and a sample from a Melanesian population to illustrate the settings in which it is advantageous to employ coarser resolutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2021

The Geometry of the space of Discrete Coalescent Trees

Computational inference of dated evolutionary histories relies upon vari...
research
04/14/2020

The Tajima heterochronous n-coalescent: inference from heterochronously sampled molecular data

The observed sequence variation at a locus informs about the evolutionar...
research
01/17/2012

The computation of first order moments on junction trees

We review some existing methods for the computation of first order momen...
research
05/31/2018

Approximate Knowledge Compilation by Online Collapsed Importance Sampling

We introduce collapsed compilation, a novel approximate inference algori...
research
10/16/2012

Fast Exact Inference for Recursive Cardinality Models

Cardinality potentials are a generally useful class of high order potent...
research
02/27/2013

State-space Abstraction for Anytime Evaluation of Probabilistic Networks

One important factor determining the computational complexity of evaluat...
research
02/13/2018

Online Variance Reduction for Stochastic Optimization

Modern stochastic optimization methods often rely on uniform sampling wh...

Please sign up or login with your details

Forgot password? Click here to reset