 This is the case during heuristic tree search under maximum parsimony (MP), maximum likelihood (ML), and minimum evolution (ME) criteria, and the same can be expected for stochastic tree search using MCMC.This problem will result in samples not approximating correctly to the posterior density.The (MC³) improves the mixing of Markov chains in presence of multiple local peaks in the posterior density.