Loading...
research article
The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths
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.
Type
research article
Web of Science ID
WOS:000283559100019
Authors
Publication date
2010
Volume
7
Issue
4
Start page
763
End page
767
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
May 1, 2009
Use this identifier to reference this record