BMC Ecology and Evolution

Table 2 Phylogeny inference simulations. 100 times MAP and MCMC phylogeny inference on 10- and 30-leaf trees, using the combined, the r × t-method, the standard and the simulated annealing-like algorithms respectively.

From: Birth-death prior on phylogeny and speed dating

		Tree size	# Iterations¹		Time²		Success³
			SAL	Std	SAL	Std	SAL	Std
Combined		10	2000	1500	50 s	15 s	98	87
	MAP	30	6000	29000	11 m	20 m	74	25
		10	4200	1700	90 s	20 s	99	100
	MCMC	30	18000	32000	20 m	25 m	80	60
r × t		10	1900	3300	45 s	25 s	99	98
	MAP	30	8000	>50000	14 m	>30 m	83	0
		10	5000	4600	100 s	30 s	96	100
	MCMC	30	22000	>50000	20 m	>30 m	54	0

¹Median number of iterations for successful runs (i.e. runs finding a tree with likelihood at least as good as the true tree).
²Median computation time needed for successful runs.
³Percentage of runs being successful.

Back to article page

ISSN: 2730-7182

Contact us

General enquiries: journalsubmissions@springernature.com