Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution
Distance based phylogenetic methods attempt to reconstruct an accurate phylogenetic tree relating a given set of taxa from an estimated matrix of pair-wise distances between taxa. This paper examines two distance based algorithms (GreedyBME and FastME) which are based on the principle of trying to minimise the balanced minimum evolution (BME) score of the output tree in relation to the given estimated distance matrix. We show firstly that these algorithms will both reconstruct the correct tree if the input data is quartet consistent, and secondly that if the maximum error in any individual distance estimate is ε, then both algorithms will output trees containing all edges of the true tree that have length at least 3ε. That is to say the algorithms have edge safety radius 1/3. In contrast, quartet consistency of the data is not sufficient to guarantee Neighbor Joining (NJ) reconstructs the correct tree, and moreover NJ has edge safety radius of 1/4, which is strictly worse.
KeywordsMaximum Error Neighbor Join Correct Tree True Tree Pendent Edge
Unable to display preview. Download preview PDF.
- 4.Desper, R., Gascuel, O.: Fast and accurate phylogeny reconstruction algorithms based on the minimum evolution principle. J. Comp. Biol. 9, 587–598 (2002), Latest software available at, http://atgc.lirmm.fr/fastme/
- 10.Mihaescu, R.: Reliability results for the general Balanced Minimum Evolution principle (in preparation)Google Scholar
- 12.Pardi, F., Guillemot, S., Gascuel, O.: Robustness of phylogenetic inference based on minimum evolution. Bulletin of Mathematical Biology (2010) (in press)Google Scholar
- 15.Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)Google Scholar
- 16.Shigezumi, T.: Robustness of greedy type minimum evolution algorithms. In: Computational Science –ICCS 2006, pp. 815–821 (2006)Google Scholar