Skip to main content
. 2007 Oct 31;4:22. doi: 10.1186/1742-9994-4-22

Table 7.

Number of tree searches for each approach needed given different numbers of taxa and partitions.

# Taxa PBS LILD NDI NDI/PABSA PABA
4 partitions
25 23 92 115 345 1,500
100 98 392 490 1,470 1,500
250 248 992 1,240 3,720 1,500
25 partitions

25 23 575 598 7.6*1011 3.3*1012
100 98 2,450 2,548 3.2*1012 3.3*1012
250 248 6,200 6,448 8.2*1012 3.3*1012
100 partitions

25 23 2,300 2,323 2.7*1033 1.2*1034
100 98 9,800 9,898 1.2*1034 1.2*1034
250 248 24,800 25,048 3.0*1034 1.2*1034

For BS based calculations it is assumed that only the nodes of the best tree are analyzed and no additional ones. For PABA the number of bootstrap replicates was kept constant with 100. NDI = only NDI is determined; NDI/PABSA = NDI and all lower orders of additions are also determined, a full-blown PABSA approach.