Bridging trees for posterior inference on ancestral recombination graphs

From MaRDI portal
Publication:5243648

DOI10.1098/RSPA.2018.0568zbMATH Open1425.92002arXiv1812.01345OpenAlexW2902478269WikidataQ90855162 ScholiaQ90855162MaRDI QIDQ5243648FDOQ5243648


Authors:


Publication date: 19 November 2019

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1812.01345




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Bridging trees for posterior inference on ancestral recombination graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243648)