Bridging trees for posterior inference on ancestral recombination graphs

DOI10.1098/RSPA.2018.0568MaRDI QIDQ5243648zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 19 November 2019

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

Full work available at URL https://arxiv.org/abs/1812.01345, http://europepmc.org/articles/pmc6304023

zbMATH Keywords

Markov chain Monte CarloBayesian inferencecoalescentancestral recombination graphtree scanning

Mathematics Subject Classification ID

Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20) Software, source code, etc. for problems pertaining to biology (92-04)

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.

Recommendations

• Bayesian Phylogenetic Inference via Markov Chain Monte Carlo Methods
• Inference from gene trees in a subdivided population
• scientific article; zbMATH DE number 2175045
• Ancestral inference in population genetics
• The distribution of waiting distances in ancestral recombination graphs

Cites work

• scientific article; zbMATH DE number 2126323 (Why is no real title available?)
• scientific article; zbMATH DE number 3817476 (Why is no real title available?)
• scientific article; zbMATH DE number 1094276 (Why is no real title available?)
• scientific article; zbMATH DE number 2117879 (Why is no real title available?)
• On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
• On the combinatorics of rooted binary phylogenetic trees
• Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees
• The coalescent

Cited in

(2)

• Ancestral recombination graphs under non-random ascertainment, with applications to gene mapping
• Arbores

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)