Bridging trees for posterior inference on ancestral recombination graphs

We present a new Markov chain Monte Carlo algorithm, implemented in the 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...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences Vol. 474; no. 2220; p. 20180568
Main Authors:	Heine, K, Beskos, A, Jasra, A, Balding, D, De Iorio, M
Format:	Journal Article
Language:	English
Published:	England The Royal Society Publishing 01-12-2018
Subjects:	Bayesian inference Markov chain Monte Carlo ancestral recombination graph tree scanning coalescent
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We present a new Markov chain Monte Carlo algorithm, implemented in the 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 parallelization.
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
ISSN:	1364-5021 1471-2946
DOI:	10.1098/rspa.2018.0568