A 3-approximation algorithm for the subtree distance between phylogenies

Authors:
Magnus Bordewich;Catherine McCartin;Charles Semple
Affiliations:
Department of Computer Science, Durham University, Durham DH1 3LE, United Kingdom;Institute of Information Sciences and Technology, Massey University, Palmerston North, New Zealand;Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 5
Cited 6

On the complexity of comparing evolutionary trees

Discrete Applied Mathematics - Special volume on computational molecular biology
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Computing the minimum number of hybridization events for a consistent evolutionary history

Discrete Applied Mathematics
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A Faster FPT Algorithm for the Maximum Agreement Forest Problem

Theory of Computing Systems

A unifying view on approximation and FPT of agreement forests

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
On the Complexity of uSPR Distance

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Walks in phylogenetic treespace

Information Processing Letters
Fast FPT algorithms for computing rooted agreement forests: theory and experiments

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Fast computation of the exact hybridization number of two phylogenetic trees

ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
Walks on SPR Neighborhoods

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a 5-approximation. We also give a faster fixed-parameter algorithm for the rooted subtree prune and regraft distance than was previously known.