Bridging trees for posterior inference on Ancestral Recombination Graphs

12/04/2018
by   Kari Heine, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/07/2022

Towards derandomising Markov chain Monte Carlo

We present a new framework to derandomise certain Markov chain Monte Car...
research
08/13/2022

Regression test of various versions of STRmix

STRmix has been in operational use since 2012 for the interpretation of ...
research
03/09/2017

Parallel Markov Chain Monte Carlo for the Indian Buffet Process

Indian Buffet Process based models are an elegant way for discovering un...
research
10/13/2022

Markov Chain Monte Carlo for generating ranked textual data

This paper faces a central theme in applied statistics and information s...
research
05/22/2018

Langevin Markov Chain Monte Carlo with stochastic gradients

Monte Carlo sampling techniques have broad applications in machine learn...
research
06/19/2020

The Normal-Generalised Gamma-Pareto process: A novel pure-jump Lévy process with flexible tail and jump-activity properties

Pure-jump Lévy processes are popular classes of stochastic processes whi...
research
01/24/2022

Inferring taxonomic placement from DNA barcoding allowing discovery of new taxa

In ecology it has become common to apply DNA barcoding to biological sam...

Please sign up or login with your details

Forgot password? Click here to reset