Bridging trees for posterior inference on ancestral recombination graphs

DOI10.1098/rspa.2018.0568zbMath1425.92002arXiv1812.01345OpenAlexW2902478269WikidataQ90855162 ScholiaQ90855162MaRDI QIDQ5243648

No author found.

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

zbMATH Keywords

Markov chain Monte CarlocoalescentBayesian inferenceancestral 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)

Related Items (1)

Arbores

Cites Work

• The coalescent
• On the combinatorics of rooted binary phylogenetic trees
• Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees
• On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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