Publication

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Krister Swenson
2010
Journal Articles

Abstract

Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a negative result on the rate of convergence of the generally used Markov chains. We prove that the relaxation time of the Markov chains walking on the optimal reversal sorting scenarios might grow exponentially with the size of the signed permutations, namely, with the number of syntheny blocks.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Chat with Graph Search

On distributional autoregression and iterated transportation

Deciphering the nature of cell state transitions in single cells using quantitative modeling of temporal dynamics

Stochastic pairwise preference convergence in Bayesian agents