We then used reversible jump for selection of all prior parameters and the BayesPhylogenies program [ 71] to construct a Markov chain of trees, using a general time reversible [ 72] model of sequence evolution with 4 discrete gamma rate heterogeneity categories.
Biogeographic reconstruction relied on statistical dispersal-vicariance analysis using S-DIVA version 2.0 [ 64] as implemented in RASP, which carries out parsimony inference on the chain of trees obtained from an MCMC search [ 65, 66], in our case the 8000 post burn-in Bayesian trees resulting from the BEAST dating analysis.
Alignments and bootstrapping or MCMC chain replicates of trees should not be included in uploads, and there is currently a 20 MB filesize cap on files committed to the repository.
For each data set we generated a chain of 8.8M trees, discarding 10% burnin, and then computed the posterior mean distance from trees in the sample to the weak and strong species trees respectively.
It is also the site of a linked chain of birds, trees, soil, plankton and manta rays so nicely forged that it deserves its own song.
This year, a bike lane will be opened along the Boulevard Ring, a chain of picturesque, tree-lined roads developed in the 1820s which form a horseshoe around Moscow's historic "white city".
Regardless of the type of society, we observed that the spatial interaction between management units caused a chain reaction of tree harvesting in the neighborhood even when healthy forested land provided greater utility than harvested land.
For the test cases analyzed a posterior probability of.99 according to [ 24], corresponds to a Bayesian posterior probability of.90 calculating using a Markov chain exploration of tree-space using [ 31] and about 70% bootstrap support.
Four chains of 4,000,000 trees were generated, sampling every 100th tree, with burning completed by the 20,000th tree; thus, 20,000 trees were used to estimate topologies and posterior probabilities of parameters.
Two runs of four chains of 5,000,000 trees were generated, sampling every 100 trees, with burning completed by the 20,000th tree.
We ran 1,000,000 generations with 1 cold and 3 incrementally heated Markov chains, random starting trees for each chain, and sampling of trees every 100 generations.
