Task | Input tree | Python 2.7 | Python 3.2 | PyPy 1.9 |
---|---|---|---|---|
Read a very large Newick tree | Smith 2011 angiosperm supertree | Â | Â | Â |
 | (55473 terminal nodes) [38] | 17.45 | 16.85 | 1.214 |
Read the same large tree in phyloXML | Smith 2011, converted to phyloXML with | Â | Â | Â |
 | phylo_converter (http://phylosoft.org/) | 3.805 | 4.318 | 3.937 |
Write the same large tree as Newick | Smith 2011 | 0.5238 | 0.7704 | 0.4378 |
Write the same large tree as phyloXML | Smith 2011 | 10.39 | 10.85 | 24.17 |
Read a medium-sized Newick tree | Davies 2004 angiosperm supertree | Â | Â | Â |
 | (440 terminal nodes) [39] | 0.1097 | 0.1087 | 0.007312 |
Parse many Newick trees | Davies 2004, copies rerooted at | Â | Â | Â |
 | each node (816 trees) | 84.91 | 84.29 | 6.812 |
Reroot at each node | Davies 2004 | 1.347 | 1.167 | 0.3450 |
Collapse all splits with bootstrap values less than 50 | Davies 2004 | 2.266 | 2.312 | 2.411 |
Total branch length | Davies 2004 | 0.01322 | 0.01310 | 0.01448 |
Ladderize the tree | Davies 2004 | 0.1274 | 0.1190 | 0.1127 |
Count terminal nodes | Davies 2004 | 0.006838 | 0.006323 | 0.005914 |