Bridging trees for posterior inference on Ancestral Recombination Graphs
Computation
2019-03-06 v1 Populations and Evolution
Abstract
We present a new Markov chain Monte Carlo algorithm, implemented in software Arbores, for inferring the history of a sample of DNA sequences. Our principal innovation is a bridging procedure, previously applied only for simple stochastic processes, in which the local computations within a bridge can proceed independently of the rest of the DNA sequence, facilitating large-scale parallelisation.
Cite
@article{arxiv.1812.01345,
title = {Bridging trees for posterior inference on Ancestral Recombination Graphs},
author = {Kari Heine and Alex Beskos and Ajay Jasra and David Balding and Maria De Iorio},
journal= {arXiv preprint arXiv:1812.01345},
year = {2019}
}
Comments
23 pages, 9 figures, accepted for publication in Proceedings of the Royal Society A