Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution.

Bordewich, Magnus; Mihaescu, Radu

Abstract

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.

Citation

Bordewich, M., & Mihaescu, R. (2010, September). Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. Presented at 10th Workshop on Algorithms in Bioinformatics (WABI 2010), Liverpool

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 10th Workshop on Algorithms in Bioinformatics (WABI 2010)
• Publication Date: 2010
• Deposit Date: Aug 2, 2010
• Print ISSN: 0302-9743
• Publisher: Springer Verlag
• Volume: 6293
• Pages: 250-261
• Series Title: Lecture Notes in Computer Science
• Book Title: Algorithms in Bioinformatics: 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings
• ISBN: 978-3-642-15293-1
• DOI: https://doi.org/10.1007/978-3-642-15294-8_21
• Public URL: https://durham-repository.worktribe.com/output/1159173