On the complexity of comparing evolutionary trees
Discrete Applied Mathematics - Special volume on computational molecular biology
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
The maximum agreement forest problem: Approximation algorithms and computational experiments
Theoretical Computer Science
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 3-approximation algorithm for the subtree distance between phylogenies
Journal of Discrete Algorithms
Approximating the Maximum Agreement Forest on k trees
Information Processing Letters
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Fast FPT algorithms for computing rooted agreement forests: theory and experiments
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees
RECOMB'13 Proceedings of the 17th international conference on Research in Computational Molecular Biology
| Hi-index | 0.00 |
We provide a unifying view on the structure of maximum (acyclic) agreement forests of rooted and unrooted phylogenies. This enables us to obtain linear- or O(n log n)-time 3-approximation and improved fixed-parameter algorithms for the subtree prune and regraft distance between two rooted phylogenies, the tree bisection and reconnection distance between two unrooted phylogenies, and the hybridization number of two rooted phylogenies.