Skip to main content

Advertisement

Table 6 Aggregating multiple trees

From: Towards a practical O(n logn) phylogeny algorithm

  % taxa R-F Quartet
  inserted Accuracy Accuracy
5 input trees (average) 83 62 85
output tree 94 48 85
output tree with forcing 100 39 83
  1. The performance of the random walk algorithm as a supertree method. We generated 5 input trees by running the random walk five times independently on the COG840 alignment. We then ran the random walk algorithm with quartet queries evaluated by taking the induced quartet in each tree, and choosing the most common one. The guide tree was chosen as the subtree induced by 200 randomly chosen taxa on one of the 5 input trees.