We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of phylogenetic trees. Their sizes correspond to the subtree-prune-and-regraft distances and the tree-bisection-and-reconnection distances of the trees, respectively. We also provide the first bounded search tree FPT algorithm for computing rooted maximum acyclic agreement forests (MAAFs) of pairs of phylogenetic trees, whose sizes are the hybridization numbers of these pairs of trees. These distance metrics are essential tools for understanding reticulate evolution.
['Chris Whidden', 'Robert G. Beiko', 'Norbert Zeh']
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests