# Bridging trees for posterior inference on Ancestral Recombination Graphs

## TL;DR

This paper introduces Arbores, a novel MCMC algorithm with a bridging technique that enables efficient, parallelizable inference of ancestral recombination graphs from DNA sequences.

## Contribution

It presents a new bridging procedure for MCMC inference of ancestral recombination graphs, allowing large-scale parallel computations.

## Key findings

- Enables scalable inference of ancestral recombination graphs.
- Facilitates parallel processing of local computations.
- Improves efficiency over previous methods.

## 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.