Research Article

Polynomial Supertree Methods Revisited

Table 6

Average running times (min:sec) of the polynomial supertree algorithms in case of 524 taxa model trees, different quantities of input trees, and different deletion ratios. Note that for this data set the running time of MRP was limited to 60 minutes, and all instances reached this time limit.

No. of input trees BWDSDM MC MMCPhySIC_ISTPhySIC_IST
𝑐 = 0 𝑐 = 1
𝑑 = 50% 75% 50% 75% 50% 75% 50% 75% 50% 75% 50% 75%

4 18:17 5:54 1:16 0:12 3:28 0:33 0:33 0:04 3345:18 1026:55 2483:26 1736:14
8 35:33 26:12 1:48 0:20 36:27 5:22 18:36 0:54 3274:32 2386:27 1505:28 1741:35
12 41:45 46:35 2:28 0:30 60:21 17:18 72:24 4:58 2003:21 5732:01 1066:54 1659:21
16 44:22 44:56 3:35 0:43 67:21 29:02 94:0414:13 1862:25 2916:44 914:09 1485:04
20 51:11 56:57 5:16 1:03 73:40 39:41 109:2033:17 1427:29 4930:45 819:55 1341:26
24 46:30 48:54 7:24 1:12 80:41 43:15 113:33 51:01 1484:52 3527:05 825:59 1114:28
28 43:02 59:19 9:35 1:51 84:02 48:07 110:60 63:27 1632:38 3116:49 881:23 1073:11
32 29:21 62:07 12:38 2:24 87:26 51:49 96:40 79:33 1626:19 2518:55 894:34 982:14
36 29:04 59:56 17:03 2:46 91:41 57:12 95:23 89:09 1480:25 1883:58 898:09 922:50
40 20:51 64:33 20:07 3:24 93:31 59:52 89:43101:59 1796:09 1683:19 897:45 859:44