Sciweavers

WEA
2010
Springer

476views Algorithms» more WEA 2010»

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

14 years 7 months ago

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...

Chris Whidden, Robert G. Beiko, Norbert Zeh

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers