Sciweavers

Share
WEA
2010
Springer

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

8 years 10 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes give the subtree-prune-and-regraft (SPR) distance and the hybridization number of the trees, respectively. We introduce new branching rules that reduce the running time of the algorithms from O(3
Chris Whidden, Robert G. Beiko, Norbert Zeh
Added 18 May 2010
Updated 18 May 2010
Type Conference
Year 2010
Where WEA
Authors Chris Whidden, Robert G. Beiko, Norbert Zeh
Comments (0)
books